Mauro Piccioni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Mauro Piccioni has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Emilio De Santis
Department of Mathematics, University of Rome La Sapienza, Rome, Italy
7 shared publications A. Germani
Istituto di Analisi dei Sistemi ed Informatica del CNR
4 shared publications- Claudio Asci
University of Trieste
3 shared publications - Gérard Letac
Université Paul Sabatier
3 shared publications Gérard Letac
2 shared publicationsSergio Scarlatti
2 shared publications
Latest Publications
- 13 June 2019
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 176 (5) , 1088-1114
Infinite Paths on a Random Environment of ${\mathbb {Z}}^2$ with Bounded and Recurrent Sums- 13 June 2019
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 176 (5) , 1088-1114
Infinite Paths on a Random Environment of ${\mathbb {Z}}^2$ with Bounded and Recurrent Sums- Open Access
Location and scale behaviour of the quantiles of a natural exponential family
Let $P_0$ be a probability on the real line generating a natural exponential family $(P_t)_{t\in \mathbb {R}}$. Fix $\alpha$ in $ (0,1).$ We show that the property that $P_t((-\infty,t)) \leq \alpha \leq P_t((-\infty,t])$ for all $t$ implies that there exists a number $\mu_\alpha$ such that $P_0$ is the Gaussian distribution $N(\mu_{\alpha},1).$ In other terms, if for all $t$, $t$ is a quantile of $P_t$ associated to some threshold $\alpha\in (0,1)$, then the exponential family must be Gaussian. The case $\alpha=1/2$, \textit{i.e.} $t$ is always a median of $P_t,$ has been considered in Letac \textit{et al.} (2018). Analogously let $Q$ be a measure on $[0,\infty)$ generating a natural exponential family $(Q_{-t})_{t>0}$. We show that $Q_{-t}([0,t^{-1}))\leq \alpha \leq Q_{-t}([0,t^{-1}])$ for all $t>0$ implies that there exists a number $p=p_{\alpha}>0$ such that $Q(dx)\propto x^{p-1}dx,$ and thus $Q_{-t}$ has to be a gamma distribution with parameters $p$ and $t.$Open AccessLocation and scale behaviour of the quantiles of a natural exponential family
Let $P_0$ be a probability on the real line generating a natural exponential family $(P_t)_{t\in \mathbb {R}}$. Fix $\alpha$ in $ (0,1).$ We show that the property that $P_t((-\infty,t)) \leq \alpha \leq P_t((-\infty,t])$ for all $t$ implies that there exists a number $\mu_\alpha$ such that $P_0$ is the Gaussian distribution $N(\mu_{\alpha},1).$ In other terms, if for all $t$, $t$ is a quantile of $P_t$ associated to some threshold $\alpha\in (0,1)$, then the exponential family must be Gaussian. The case $\alpha=1/2$, \textit{i.e.} $t$ is always a median of $P_t,$ has been considered in Letac \textit{et al.} (2018). Analogously let $Q$ be a measure on $[0,\infty)$ generating a natural exponential family $(Q_{-t})_{t>0}$. We show that $Q_{-t}([0,t^{-1}))\leq \alpha \leq Q_{-t}([0,t^{-1}])$ for all $t>0$ implies that there exists a number $p=p_{\alpha}>0$ such that $Q(dx)\propto x^{p-1}dx,$ and thus $Q_{-t}$ has to be a gamma distribution with parameters $p$ and $t.$ - Open Access
The medians for exponential families and the normal law
Let $P$ a probability on the real line generating a natural exponential family $(P_t)_{t\in \R}$. We show that $t$ is a median of $P_t$ for all $t$ only if $P$ is the standard Gaussian law $N(0.1).$ The proof is based on the Choquet Deny equation.Open AccessThe medians for exponential families and the normal law
Let $P$ a probability on the real line generating a natural exponential family $(P_t)_{t\in \R}$. We show that $t$ is a median of $P_t$ for all $t$ only if $P$ is the standard Gaussian law $N(0.1).$ The proof is based on the Choquet Deny equation. - 31 July 2015
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 161 (2) , 346-364
One-Dimensional Infinite Memory Imitation Models with Noise
- 31 July 2015
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 161 (2) , 346-364
One-Dimensional Infinite Memory Imitation Models with Noise
- 1 December 2014
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 51 (4) , 1081-1099
Dirichlet Random Walks
This paper provides tools for the study of the Dirichlet random walk in Rd. We compute explicitly, for a number of cases, the distribution of the random variable W using a form of Stieltjes transform of W instead of the Laplace transform, replacing the Bessel functions with hypergeometric functions. This enables us to simplify some existing results, in particular, some of the proofs by Le Caër (2010), (2011). We extend our results to the study of the limits of the Dirichlet random walk when the number of added terms goes to ∞, interpreting the results in terms of an integral by a Dirichlet process. We introduce the ideas of Dirichlet semigroups and Dirichlet infinite divisibility and characterize these infinite divisible distributions in the sense of Dirichlet when they are concentrated on the unit sphere of Rd.
- 1 December 2014
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 51 (4) , 1081-1099
Dirichlet Random Walks
This paper provides tools for the study of the Dirichlet random walk in Rd. We compute explicitly, for a number of cases, the distribution of the random variable W using a form of Stieltjes transform of W instead of the Laplace transform, replacing the Bessel functions with hypergeometric functions. This enables us to simplify some existing results, in particular, some of the proofs by Le Caër (2010), (2011). We extend our results to the study of the limits of the Dirichlet random walk when the number of added terms goes to ∞, interpreting the results in terms of an integral by a Dirichlet process. We introduce the ideas of Dirichlet semigroups and Dirichlet infinite divisibility and characterize these infinite divisible distributions in the sense of Dirichlet when they are concentrated on the unit sphere of Rd.
- Open Access
- 21 February 2013
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 150 (6) , 1017-1029
Perfect Simulation of Autoregressive Models with Infinite Memory
- 21 February 2013
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 150 (6) , 1017-1029
Open AccessPerfect Simulation of Autoregressive Models with Infinite Memory
- Open Access
Perfect simulation of autoregressive models with infinite memory
In this paper we consider the problem of determining the law of binary stochastic processes from transition kernels depending on the whole past. These kernels are linear in the past values of the process. They are allowed to assume values close to both 0 and 1, preventing the application of usual results on uniqueness. More precisely we give sufficient conditions for uniqueness and non-uniqueness. In the former case a perfect simulation algorithm is also given.
Open AccessPerfect simulation of autoregressive models with infinite memory
In this paper we consider the problem of determining the law of binary stochastic processes from transition kernels depending on the whole past. These kernels are linear in the past values of the process. They are allowed to assume values close to both 0 and 1, preventing the application of usual results on uniqueness. More precisely we give sufficient conditions for uniqueness and non-uniqueness. In the former case a perfect simulation algorithm is also given.
- 1 June 2012
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 49 (2) , 319-337
Backward Coalescence Times for Perfect Simulation of Chains with Infinite Memory
This paper is devoted to the perfect simulation of a stationary process with an at most countable state space. The process is specified through a kernel, prescribing the probability of the next state conditional to the whole past history. We follow the seminal work of Comets, Fernández and Ferrari (2002), who gave sufficient conditions for the construction of a perfect simulation algorithm. We definebackward coalescence timesfor these kind of processes, which allow us to construct perfect simulation algorithms under weaker conditions than in Comets, Fernández and Ferrari (2002). We discuss how to construct backward coalescence times (i) by means ofinformation depths, taking into account some a priori knowledge about the histories that occur; and (ii) by identifying suitablecoalescing events.
- 1 June 2012
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 49 (2) , 319-337
Backward Coalescence Times for Perfect Simulation of Chains with Infinite Memory
This paper is devoted to the perfect simulation of a stationary process with an at most countable state space. The process is specified through a kernel, prescribing the probability of the next state conditional to the whole past history. We follow the seminal work of Comets, Fernández and Ferrari (2002), who gave sufficient conditions for the construction of a perfect simulation algorithm. We definebackward coalescence timesfor these kind of processes, which allow us to construct perfect simulation algorithms under weaker conditions than in Comets, Fernández and Ferrari (2002). We discuss how to construct backward coalescence times (i) by means ofinformation depths, taking into account some a priori knowledge about the histories that occur; and (ii) by identifying suitablecoalescing events.
- Open Access
- 1 May 2012
- Published by Institute of Mathematical Statistics in The Annals of Probability
- Vol. 40 (3) , 1105-1134
Random continued fractions with beta-hypergeometric distribution
In a recent paper [Statist. Probab. Lett. 78 (2008) 1711–1721] it has been shown that certain random continued fractions have a density which is a product of a beta density and a hypergeometric function 2F1. In the present paper we fully exploit a formula due to Thomae [J. Reine Angew. Math. 87 (1879) 26–73] in order to generalize substantially the class of random continuous fractions with a density of the above form. This involves the design of seven particular graphs. Infinite paths on them lead to random continued fractions with an explicit distribution. A careful study about the set of five real parameters leading to a beta-hypergeometric distribution is required, relying on almost forgotten results mainly due to Felix Klein.
- 1 May 2012
- Published by Institute of Mathematical Statistics in The Annals of Probability
- Vol. 40 (3) , 1105-1134
Open AccessRandom continued fractions with beta-hypergeometric distribution
In a recent paper [Statist. Probab. Lett. 78 (2008) 1711–1721] it has been shown that certain random continued fractions have a density which is a product of a beta density and a hypergeometric function 2F1. In the present paper we fully exploit a formula due to Thomae [J. Reine Angew. Math. 87 (1879) 26–73] in order to generalize substantially the class of random continuous fractions with a density of the above form. This involves the design of seven particular graphs. Infinite paths on them lead to random continued fractions with an explicit distribution. A careful study about the set of five real parameters leading to a beta-hypergeometric distribution is required, relying on almost forgotten results mainly due to Felix Klein.
- Open Access
A general framework for perfect simulation of long memory processes
In this paper a general approach for the perfect simulation of a stationary process with at most countable state space is outlined. The process is specified through a kernel, prescribing the probability of each state conditional to the whole past history. We follow the seminal paper of Comets, Fernandez and Ferrari, where sufficient conditions for the construction of a certain perfect simulation algorithm have been given. We generalize this approach by defining backward coalescence times for these kind of processes; this allows us to construct perfect simulation algorithms under weaker conditions.
Open AccessA general framework for perfect simulation of long memory processes
In this paper a general approach for the perfect simulation of a stationary process with at most countable state space is outlined. The process is specified through a kernel, prescribing the probability of each state conditional to the whole past history. We follow the seminal paper of Comets, Fernandez and Ferrari, where sufficient conditions for the construction of a certain perfect simulation algorithm have been given. We generalize this approach by defining backward coalescence times for these kind of processes; this allows us to construct perfect simulation algorithms under weaker conditions.