Electronic Communications in Probability Articles (Project Euclid)
http://projecteuclid.org/euclid.ecp
The latest articles from Electronic Communications in Probability on Project Euclid, a site for mathematics and statistics resources.en-usCopyright 2017 Cornell University LibraryEuclid-L@cornell.edu (Project Euclid Team)Tue, 14 Feb 2017 04:00 ESTTue, 14 Feb 2017 04:00 ESThttp://projecteuclid.org/collection/euclid/images/logo_linking_100.gifProject Euclid
http://projecteuclid.org/
The Intrinsic geometry of some random manifolds
http://projecteuclid.org/euclid.ecp/1483585770
<strong>Sunder Ram Krishnan</strong>, <strong>Jonathan E. Taylor</strong>, <strong>Robert J. Adler</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 22, 12 pp..</p><p><strong>Abstract:</strong><br/>
We study the a.s. convergence of a sequence of random embeddings of a fixed manifold into Euclidean spaces of increasing dimensions. We show that the limit is deterministic. As a consequence, we show that many intrinsic functionals of the embedded manifolds also converge to deterministic limits. Particularly interesting examples of these functionals are given by the Lipschitz-Killing curvatures, for which we also prove unbiasedness, using the Gaussian kinematic formula.
</p>projecteuclid.org/euclid.ecp/1483585770_20170214040037Tue, 14 Feb 2017 04:00 ESTExtremal decomposition for random Gibbs measures: from general metastates to metastates on extremal random Gibbs measureshttps://projecteuclid.org/euclid.ecp/1545102491<strong>Codina Cotar</strong>, <strong>Benedikt Jahnel</strong>, <strong>Christof Külske</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 23, 12 pp..</p><p><strong>Abstract:</strong><br/>
The concept of metastate measures on the states of a random spin system was introduced to be able to treat the large-volume asymptotics for complex quenched random systems, like spin glasses, which may exhibit chaotic volume dependence in the strong-coupling regime. We consider the general issue of the extremal decomposition for Gibbsian specifications which depend measurably on a parameter that may describe a whole random environment in the infinite volume. Given a random Gibbs measure, as a measurable map from the environment space, we prove measurability of its decomposition measure on pure states at fixed environment, with respect to the environment. As a general corollary we obtain that, for any metastate, there is an associated decomposition metastate, which is supported on the extremes for almost all environments, and which has the same barycenter.
</p>projecteuclid.org/euclid.ecp/1545102491_20181221220228Fri, 21 Dec 2018 22:02 ESTShifted critical threshold in the loop $ \boldsymbol{O(n)} $ model at arbitrarily small $n$https://projecteuclid.org/euclid.ecp/1545102492<strong>Lorenzo Taggi</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 23, 9 pp..</p><p><strong>Abstract:</strong><br/>
In the loop $O(n)$ model a collection of mutually-disjoint self-avoiding loops is drawn at random on a finite domain of a lattice with probability proportional to \[\lambda ^{ \# \mbox{ edges} } n^{ \# \mbox{ loops} },\] where $\lambda , n \in [0, \infty )$. Let $\mu $ be the connective constant of the lattice and, for any $n \in [0, \infty )$, let $\lambda _c(n)$ be the largest value of $\lambda $ such that the loop length admits uniformly bounded exponential moments. It is not difficult to prove that $\lambda _c(n) =1/\mu $ when $n=0$ (in this case the model corresponds to the self-avoiding walk) and that for any $n \geq 0$, $\lambda _c(n) \geq 1/\mu $. In this note we prove that, \[ \lambda _c(n) > 1/\mu \, \, \, \, \forall n >0, \] \[\lambda _c(n) \geq 1/\mu \, + \, c_0 \, n \, + \, O(n^2) \, \, \mbox{ as $n \rightarrow 0$,} \] on $\mathbb{Z} ^d$, with $d \geq 2$, and on the hexagonal lattice, where $c_0>0$. This means that, when $n$ is positive (even arbitrarily small), as a consequence of the mutual repulsion between the loops, a phase transition can only occur at a strictly larger critical threshold than in the self-avoiding walk.
</p>projecteuclid.org/euclid.ecp/1545102492_20181221220228Fri, 21 Dec 2018 22:02 ESTOn the supremum of products of symmetric stable processeshttps://projecteuclid.org/euclid.ecp/1545102493<strong>Christophe Profeta</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 23, 13 pp..</p><p><strong>Abstract:</strong><br/>
We study the asymptotics, for small and large values, of the supremum of a product of symmetric stable processes. We show in particular that the lower tail exponent remains the same as for only one process, possibly up to some logarithmic terms. The proof relies on a path construction of stable bridges using last sign changes.
</p>projecteuclid.org/euclid.ecp/1545102493_20181221220228Fri, 21 Dec 2018 22:02 ESTThe genealogy of an exactly solvable Ornstein–Uhlenbeck type branching process with selectionhttps://projecteuclid.org/euclid.ecp/1545102494<strong>Aser Cortines</strong>, <strong>Bastien Mallein</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 23, 13 pp..</p><p><strong>Abstract:</strong><br/>
We study the genealogy of an exactly solvable population model with $N$ particles on the real line, which evolves according to a discrete-time branching process with selection. At each time step, every particle gives birth to children around $a$ times its current position, where $a>0$ is a parameter of the model. Then, the $N$ rightmost newborn children are selected to form the next generation. We show that the genealogy of the process converges toward a Beta coalescent as $N \to \infty $. The process we consider can be seen as a toy model version of a continuous-time branching process with selection, in which particles move according to independent Ornstein–Uhlenbeck processes. The parameter $a$ is akin to the pulling strength of the Ornstein–Uhlenbeck process.
</p>projecteuclid.org/euclid.ecp/1545102494_20181221220228Fri, 21 Dec 2018 22:02 ESTA spectral decomposition for the block counting process and the fixation line of the beta(3,1)-coalescenthttps://projecteuclid.org/euclid.ecp/1545447666<strong>Martin Möhle</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 23, 15 pp..</p><p><strong>Abstract:</strong><br/>
A spectral decomposition for the generator of the block counting process of the $\beta (3,1)$-coalescent is provided. This decomposition is strongly related to Riordan matrices and particular Fuss–Catalan numbers. The result is applied to obtain formulas for the distribution function and the moments of the absorption time of the $\beta (3,1)$-coalescent restricted to a sample of size $n$. We also provide the analog spectral decomposition for the fixation line of the $\beta (3,1)$-coalescent. The main tools in the proofs are generating functions and Siegmund duality. Generalizations to the $\beta (a,1)$-coalescent with parameter $a\in (0,\infty )$ are discussed leading to fractional differential or integral equations.
</p>projecteuclid.org/euclid.ecp/1545447666_20181221220228Fri, 21 Dec 2018 22:02 ESTPropagation of chaos for a balls into bins modelhttps://projecteuclid.org/euclid.ecp/1546571102<strong>Nicoletta Cancrini</strong>, <strong>Gustavo Posta</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 9 pp..</p><p><strong>Abstract:</strong><br/>
Consider a ﬁnite number of balls initially placed in $L$ bins. At each time step a ball is taken from each non-empty bin. Then all the balls are uniformly reassigned into bins. This ﬁnite Markov chain is called Repeated Balls-into-Bins process and is a discrete time interacting particle system with parallel updating. We prove that, starting from a suitable ( chaotic ) set of initial states, as $L\to +\infty $, the numbers of balls in each bin become independent from the rest of the system i.e. we have propagation of chaos . We furthermore study some equilibrium properties of the limiting nonlinear process .
</p>projecteuclid.org/euclid.ecp/1546571102_20190103220507Thu, 03 Jan 2019 22:05 ESTLimit theorems for the tagged particle in exclusion processes on regular treeshttps://projecteuclid.org/euclid.ecp/1548299047<strong>Dayue Chen</strong>, <strong>Peng Chen</strong>, <strong>Nina Gantert</strong>, <strong>Dominik Schmid</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 10 pp..</p><p><strong>Abstract:</strong><br/>
We consider exclusion processes on a rooted $d$-regular tree. We start from a Bernoulli product measure conditioned on having a particle at the root, which we call the tagged particle. For $d\geq 3$, we show that the tagged particle has positive linear speed and satisfies a central limit theorem. We give an explicit formula for the speed. As a key step in the proof, we first show that the exclusion process “seen from the tagged particle” has an ergodic invariant measure.
</p>projecteuclid.org/euclid.ecp/1548299047_20190123220414Wed, 23 Jan 2019 22:04 ESTScaling of the Sasamoto-Spohn model in equilibriumhttps://projecteuclid.org/euclid.ecp/1548817627<strong>Milton Jara</strong>, <strong>Gregorio R. Moreno Flores</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 12 pp..</p><p><strong>Abstract:</strong><br/>
We prove the convergence of the Sasamoto-Spohn model in equilibrium to the energy solution of the stochastic Burgers equation on the whole line. The proof, which relies on the second order Boltzmann-Gibbs principle, follows the approach of [9] and does not use any spectral gap argument.
</p>projecteuclid.org/euclid.ecp/1548817627_20190129220717Tue, 29 Jan 2019 22:07 ESTContinuity and growth of free multiplicative convolution semigroupshttps://projecteuclid.org/euclid.ecp/1548817631<strong>Xiaoxue Deng</strong>, <strong>Ping Zhong</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 11 pp..</p><p><strong>Abstract:</strong><br/>
Let $\mu $ be a compactly supported probability measure on the positive half-line and let $\mu ^{\boxtimes t}$ be the free multiplicative convolution semigroup. We show that the support of $\mu ^{\boxtimes t}$ varies continuously as $t$ changes. We also obtain the asymptotic length of the support of these measures.
</p>projecteuclid.org/euclid.ecp/1548817631_20190129220717Tue, 29 Jan 2019 22:07 ESTHeat kernel estimates and intrinsic metric for random walks with general speed measure under degenerate conductanceshttps://projecteuclid.org/euclid.ecp/1549357292<strong>Sebastian Andres</strong>, <strong>Jean-Dominique Deuschel</strong>, <strong>Martin Slowik</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 17 pp..</p><p><strong>Abstract:</strong><br/>
We establish heat kernel upper bounds for a continuous-time random walk under unbounded conductances satisfying an integrability assumption, where we correct and extend recent results in [3] to a general class of speed measures. The resulting heat kernel estimates are governed by the intrinsic metric induced by the speed measure. We also provide a comparison result of this metric with the usual graph distance, which is optimal in the context of the random conductance model with ergodic conductances.
</p>projecteuclid.org/euclid.ecp/1549357292_20190205040139Tue, 05 Feb 2019 04:01 ESTErratum: Nonconventional random matrix productshttps://projecteuclid.org/euclid.ecp/1549530018<strong>Yuri Kifer</strong>, <strong>Sasha Sodin</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 1 pp..</p><p><strong>Abstract:</strong><br/>
The proof of Theorem 2.3 in our paper [3] is fully justified only under the additional assumption $q_i(n)=a_in+b_i,\, i=1,...,\ell $.
</p>projecteuclid.org/euclid.ecp/1549530018_20190207040023Thu, 07 Feb 2019 04:00 ESTOn the tails of the limiting QuickSort densityhttps://projecteuclid.org/euclid.ecp/1550113298<strong>James Allen Fill</strong>, <strong>Wei-Chun Hung</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 11 pp..</p><p><strong>Abstract:</strong><br/>
We give upper and lower asymptotic bounds for the left tail and for the right tail of the continuous limiting QuickSort density $f$ that are nearly matching in each tail. The bounds strengthen results from a paper of Svante Janson (2015) concerning the corresponding distribution function $F$. Furthermore, we obtain similar bounds on absolute values of derivatives of $f$ of each order.
</p>projecteuclid.org/euclid.ecp/1550113298_20190213220146Wed, 13 Feb 2019 22:01 ESTDean-Kawasaki dynamics: ill-posedness vs. trivialityhttps://projecteuclid.org/euclid.ecp/1550113299<strong>Vitalii Konarovskyi</strong>, <strong>Tobias Lehmann</strong>, <strong>Max-K. von Renesse</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 9 pp..</p><p><strong>Abstract:</strong><br/>
We prove that the Dean-Kawasaki SPDE admits a solution only in integer parameter regimes, in which case the solution is given in terms of a system of non-interacting particles.
</p>projecteuclid.org/euclid.ecp/1550113299_20190213220146Wed, 13 Feb 2019 22:01 ESTAlmost sure limit theorems on Wiener chaos: the non-central casehttps://projecteuclid.org/euclid.ecp/1550199821<strong>Ehsan Azmoodeh</strong>, <strong>Ivan Nourdin</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 12 pp..</p><p><strong>Abstract:</strong><br/>
In [1], a framework to prove almost sure central limit theorems for sequences $(G_n)$ belonging to the Wiener space was developed, with a particular emphasis of the case where $G_n$ takes the form of a multiple Wiener-Itô integral with respect to a given isonormal Gaussian process. In the present paper, we complement the study initiated in [1], by considering the more general situation where the sequence $(G_n)$ may not need to converge to a Gaussian distribution. As an application, we prove that partial sums of Hermite polynomials of increments of fractional Brownian motion satisfy an almost sure limit theorem in the long-range dependence case, a problem left open in [1].
</p>projecteuclid.org/euclid.ecp/1550199821_20190214220349Thu, 14 Feb 2019 22:03 ESTCritical percolation and the incipient infinite cluster on Galton-Watson treeshttps://projecteuclid.org/euclid.ecp/1550480494<strong>Marcus Michelen</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 13 pp..</p><p><strong>Abstract:</strong><br/>
We consider critical percolation on Galton-Watson trees and prove quenched analogues of classical theorems of critical branching processes. We show that the probability critical percolation reaches depth $n$ is asymptotic to a tree-dependent constant times $n^{-1}$. Similarly, conditioned on critical percolation reaching depth $n$, the number of vertices at depth $n$ in the critical percolation cluster almost surely converges in distribution to an exponential random variable with mean depending only on the offspring distribution. The incipient infinite cluster (IIC) is constructed for a.e. Galton-Watson tree and we prove a limit law for the number of vertices in the IIC at depth $n$, again depending only on the offspring distribution. Provided the offspring distribution used to generate these Galton-Watson trees has all finite moments, each of these results holds almost-surely.
</p>projecteuclid.org/euclid.ecp/1550480494_20190218040140Mon, 18 Feb 2019 04:01 ESTExpectation of the largest bet size in the Labouchere systemhttps://projecteuclid.org/euclid.ecp/1550826036<strong>Yanjun Han</strong>, <strong>Guanyang Wang</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 10 pp..</p><p><strong>Abstract:</strong><br/>
For the Labouchere system with winning probability $p$ at each coup, we prove that the expectation of the largest bet size under any initial list is finite if $p>\frac{1} {2}$, and is infinite if $p\le \frac{1} {2}$, solving the open conjecture in [6]. The same result holds for a general family of betting systems, and the proof builds upon a recursive representation of the optimal betting system in the larger family.
</p>projecteuclid.org/euclid.ecp/1550826036_20190222040046Fri, 22 Feb 2019 04:00 ESTConcentration for Coulomb gases on compact manifoldshttps://projecteuclid.org/euclid.ecp/1553133701<strong>David García-Zelada</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 18 pp..</p><p><strong>Abstract:</strong><br/>
We study the non-asymptotic behavior of a Coulomb gas on a compact Riemannian manifold. This gas is a symmetric n-particle Gibbs measure associated to the two-body interaction energy given by the Green function. We encode such a particle system by using an empirical measure. Our main result is a concentration inequality in Kantorovich-Wasserstein distance inspired from the work of Chafaï, Hardy and Maïda on the Euclidean space. Their proof involves large deviation techniques together with an energy-distance comparison and a regularization procedure based on the superharmonicity of the Green function. This last ingredient is not available on a manifold. We solve this problem by using the heat kernel and its short-time asymptotic behavior.
</p>projecteuclid.org/euclid.ecp/1553133701_20190320220157Wed, 20 Mar 2019 22:01 EDTClosed-form formulas for the distribution of the jumps of doubly-stochastic Poisson processeshttps://projecteuclid.org/euclid.ecp/1553133702<strong>Arturo Valdivia</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 12 pp..</p><p><strong>Abstract:</strong><br/>
We study the obtainment of closed-form formulas for the distribution of the jumps of a doubly-stochastic Poisson process. The problem is approached in two ways. On the one hand, we translate the problem to the computation of multiple derivatives of the Hazard process cumulant generating function; this leads to a closed-form formula written in terms of Bell polynomials. On the other hand, for Hazard processes driven by Lévy processes, we use Malliavin calculus in order to express the aforementioned distributions in an appealing recursive manner. We outline the potential application of these results in credit risk.
</p>projecteuclid.org/euclid.ecp/1553133702_20190320220157Wed, 20 Mar 2019 22:01 EDTA Hoeffding inequality for Markov chainshttps://projecteuclid.org/euclid.ecp/1553133703<strong>Shravas Rao</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 11 pp..</p><p><strong>Abstract:</strong><br/>
We prove deviation bounds for the random variable $\sum _{i=1}^{n} f_i(Y_i)$ in which $\{Y_i\}_{i=1}^{\infty }$ is a Markov chain with stationary distribution and state space $[N]$, and $f_i: [N] \rightarrow [-a_i, a_i]$. Our bound improves upon previously known bounds in that the dependence is on $\sqrt{a_1^2+\cdots +a_n^2} $ rather than $\max _{i}\{a_i\}\sqrt{n} .$ We also prove deviation bounds for certain types of sums of vector–valued random variables obtained from a Markov chain in a similar manner. One application includes bounding the expected value of the Schatten $\infty $-norm of a random matrix whose entries are obtained from a Markov chain.
</p>projecteuclid.org/euclid.ecp/1553133703_20190320220157Wed, 20 Mar 2019 22:01 EDTA spectral decomposition for a simple mutation modelhttps://projecteuclid.org/euclid.ecp/1553133704<strong>Martin Möhle</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 14 pp..</p><p><strong>Abstract:</strong><br/>
We consider a population of $N$ individuals. Each individual has a type belonging to some at most countable type space $K$. At each time step each individual of type $k\in K$ mutates to type $l\in K$ independently of the other individuals with probability $m_{k,l}$. It is shown that the associated empirical measure process is Markovian. For the two-type case $K=\{0,1\}$ we derive an explicit spectral decomposition for the transition matrix $P$ of the Markov chain $Y=(Y_n)_{n\ge 0}$, where $Y_n$ denotes the number of individuals of type $1$ at time $n$. The result in particular shows that $P$ has eigenvalues $(1-m_{0,1}-m_{1,0})^i$, $i\in \{0,\ldots ,N\}$. Applications to mean first passage times are provided.
</p>projecteuclid.org/euclid.ecp/1553133704_20190320220157Wed, 20 Mar 2019 22:01 EDTError bounds in normal approximation for the squared-length of total spin in the mean field classical $N$-vector modelshttps://projecteuclid.org/euclid.ecp/1553220032<strong>Lê Vǎn Thành</strong>, <strong>Nguyen Ngoc Tu</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 12 pp..</p><p><strong>Abstract:</strong><br/>
This paper gives the Kolmogorov and Wasserstein bounds in normal approximation for the squared-length of total spin in the mean field classical $N$-vector models. The Kolmogorov bound is new while the Wasserstein bound improves a result obtained recently by Kirkpatrick and Nawaz [Journal of Statistical Physics, 165 (2016), no. 6, 1114–1140]. The proof is based on Stein’s method for exchangeable pairs.
</p>projecteuclid.org/euclid.ecp/1553220032_20190321220109Thu, 21 Mar 2019 22:01 EDTConditions for the finiteness of the moments of the volume of level setshttps://projecteuclid.org/euclid.ecp/1553220033<strong>D. Armentano</strong>, <strong>J-M. Azaïs</strong>, <strong>D. Ginsbourger</strong>, <strong>J.R. León</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 8 pp..</p><p><strong>Abstract:</strong><br/>
Let $X(t)$ be a Gaussian random field $\mathbb R^d\to \mathbb R$. Using the notion of $(d-1)$- integral geometric measures , we establish a relation between (a) the volume of level sets, and (b) the number of crossings of the restriction of the random field to a line. Using this relation we prove the equivalence between the finiteness of the expectation and the finiteness of the second spectral moment matrix. Sufficient conditions for finiteness of higher moments are also established.
</p>projecteuclid.org/euclid.ecp/1553220033_20190321220109Thu, 21 Mar 2019 22:01 EDTCritical Liouville measure as a limit of subcritical measureshttps://projecteuclid.org/euclid.ecp/1553306557<strong>Juhan Aru</strong>, <strong>Ellen Powell</strong>, <strong>Avelio Sepúlveda</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 16 pp..</p><p><strong>Abstract:</strong><br/>
We study how the Gaussian multiplicative chaos (GMC) measures $\mu ^\gamma $ corresponding to the 2D Gaussian free field change when $\gamma $ approaches the critical parameter $2$. In particular, we show that as $\gamma \to 2^{-}$, $(2-\gamma )^{-1}\mu ^\gamma $ converges in probability to $2\mu '$, where $\mu '$ is the critical GMC measure.
</p>projecteuclid.org/euclid.ecp/1553306557_20190322220259Fri, 22 Mar 2019 22:02 EDTSubsequential tightness of the maximum of two dimensional Ginzburg-Landau fieldshttps://projecteuclid.org/euclid.ecp/1553306561<strong>Wei Wu</strong>, <strong>Ofer Zeitouni</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 12 pp..</p><p><strong>Abstract:</strong><br/>
We prove the subsequential tightness of centered maxima of two-dimensional Ginzburg-Landau fields with bounded elliptic contrast.
</p>projecteuclid.org/euclid.ecp/1553306561_20190322220259Fri, 22 Mar 2019 22:02 EDTOn coupling and “vacant set level set” percolationhttps://projecteuclid.org/euclid.ecp/1554170646<strong>Alain-Sol Sznitman</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 12 pp..</p><p><strong>Abstract:</strong><br/>
In this note we discuss “vacant set level set” percolation on a transient weighted graph. It interpolates between the percolation of the vacant set of random interlacements and the level set percolation of the Gaussian free field. We employ coupling and derive a stochastic domination from which we deduce in a rather general set-up a certain monotonicity property of the percolation function. In the case of regular trees this stochastic domination leads to a strict inequality between some eigenvalues related to Ornstein-Uhlenbeck semi-groups for which we have no direct analytical proof. It underpins a certain strict monotonicity property that has significant consequences for the percolation diagram. It is presently open whether a similar looking diagram holds in the case of ${\mathbb Z}^d$, $d \ge 3$.
</p>projecteuclid.org/euclid.ecp/1554170646_20190401220412Mon, 01 Apr 2019 22:04 EDTA note on transportation cost inequalities for diffusions with reflectionshttps://projecteuclid.org/euclid.ecp/1554429763<strong>Soumik Pal</strong>, <strong>Andrey Sarantsev</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 11 pp..</p><p><strong>Abstract:</strong><br/>
We prove that reflected Brownian motion with normal reflections in a convex domain satisfies a dimension free Talagrand type transportation cost-information inequality. The result is generalized to other reflected diffusion processes with suitable drift and diffusion coefficients. We apply this to get such an inequality for interacting Brownian particles with rank-based drift and diffusion coefficients such as the infinite Atlas model. This is an improvement over earlier dimension-dependent results.
</p>projecteuclid.org/euclid.ecp/1554429763_20190404220300Thu, 04 Apr 2019 22:03 EDTSimultaneous boundary hitting by coupled reflected Brownian motionshttps://projecteuclid.org/euclid.ecp/1555034600<strong>Krzysztof Burdzy</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 12 pp..</p><p><strong>Abstract:</strong><br/>
Mirror coupled reflected Brownian motions can simultaneously hit opposite sides of a wedge at different distances from the origin.
</p>projecteuclid.org/euclid.ecp/1555034600_20190411220330Thu, 11 Apr 2019 22:03 EDTRandom replacements in Pólya urns with infinitely many colourshttps://projecteuclid.org/euclid.ecp/1556589626<strong>Svante Janson</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 11 pp..</p><p><strong>Abstract:</strong><br/>
We consider the general version of Pólya urns recently studied by Bandyopadhyay and Thacker (2016+) and Mailler and Marckert (2017), with the space of colours being any Borel space $S$ and the state of the urn being a finite measure on $S$. We consider urns with random replacements, and show that these can be regarded as urns with deterministic replacements using the colour space $S\times [0,1]$.
</p>projecteuclid.org/euclid.ecp/1556589626_20190429220038Mon, 29 Apr 2019 22:00 EDTExit boundaries of multidimensional SDEshttps://projecteuclid.org/euclid.ecp/1558339220<strong>Russell Lyons</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 2 pp..</p><p><strong>Abstract:</strong><br/>
We show that solutions to multidimensional SDEs with Lipschitz coefficients and driven by Brownian motion never reach the set where all coefficients vanish unless the initial position belongs to that set.
</p>projecteuclid.org/euclid.ecp/1558339220_20190520040042Mon, 20 May 2019 04:00 EDTAn infinite-dimensional helix invariant under spherical projectionshttps://projecteuclid.org/euclid.ecp/1559354658<strong>Zakhar Kabluchko</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 13 pp..</p><p><strong>Abstract:</strong><br/>
We classify all subsets $S$ of the projective Hilbert space with the following property: for every point $\pm s_{0}\in S$, the spherical projection of $S\backslash \{\pm s_{0}\}$ on the hyperplane orthogonal to $\pm s_{0}$ is isometric to $S\backslash \{\pm s_{0}\}$. In probabilistic terms, this means that we characterize all zero-mean Gaussian processes $Z=(Z(t))_{t\in T}$ with the property that for every $s_{0}\in T$ the conditional distribution of $(Z(t))_{t\in T}$ given that $Z(s_{0})=0$ coincides with the distribution of $(\varphi (t; s_{0}) Z(t))_{t\in T}$ for some function $\varphi (t;s_{0})$. A basic example of such process is the stationary zero-mean Gaussian process $(X(t))_{t\in \mathbb{R} }$ with covariance function $\mathbb E [X(s) X(t)] = 1/\cosh (t-s)$. We show that, in general, the process $Z$ can be decomposed into a union of mutually independent processes of two types: (i) processes of the form $(a(t) X(\psi (t)))_{t\in T}$, with $a: T\to \mathbb{R} $, $\psi (t): T\to \mathbb{R} $, and (ii) certain exceptional Gaussian processes defined on four-point index sets. The above problem is reduced to the classification of metric spaces in which in every triangle the largest side equals the sum of the remaining two sides.
</p>projecteuclid.org/euclid.ecp/1559354658_20190531220434Fri, 31 May 2019 22:04 EDTThe frog model on trees with drifthttps://projecteuclid.org/euclid.ecp/1559354659<strong>Erin Beckman</strong>, <strong>Natalie Frank</strong>, <strong>Yufeng Jiang</strong>, <strong>Matthew Junge</strong>, <strong>Si Tang</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 10 pp..</p><p><strong>Abstract:</strong><br/>
We provide a uniform upper bound on the minimal drift so that the one-per-site frog model on a $d$-ary tree is recurrent. To do this, we introduce a subprocess that couples across trees with different degrees. Finding couplings for frog models on nested sequences of graphs is known to be difficult. The upper bound comes from combining the coupling with a new, simpler proof that the frog model on a binary tree is recurrent when the drift is sufficiently strong. Additionally, we describe a coupling between frog models on trees for which the degree of the smaller tree divides that of the larger one. This implies that the critical drift has a limit as $d$ tends to infinity along certain subsequences.
</p>projecteuclid.org/euclid.ecp/1559354659_20190531220434Fri, 31 May 2019 22:04 EDTThe bullet problem with discrete speedshttps://projecteuclid.org/euclid.ecp/1559700463<strong>Brittany Dygert</strong>, <strong>Christoph Kinzel</strong>, <strong>Matthew Junge</strong>, <strong>Annie Raymond</strong>, <strong>Erik Slivken</strong>, <strong>Jennifer Zhu</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 11 pp..</p><p><strong>Abstract:</strong><br/>
Bullets are fired from the origin of the positive real line, one per second, with independent speeds sampled uniformly from a discrete set. Collisions result in mutual annihilation. We show that a bullet with the second largest speed survives with positive probability, while a bullet with the smallest speed does not. This also holds for exponential spacings between firing times. Our results imply that the middle-velocity particle survives with positive probability in a two-sided version of the bullet process with three speeds known to physicists as ballistic annihilation.
</p>projecteuclid.org/euclid.ecp/1559700463_20190604220755Tue, 04 Jun 2019 22:07 EDTImproved Hölder continuity near the boundary of one-dimensional super-Brownian motionhttps://projecteuclid.org/euclid.ecp/1559700464<strong>Jieliang Hong</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 12 pp..</p><p><strong>Abstract:</strong><br/>
We show that the local time of one-dimensional super-Brownian motion is locally $\gamma $-Hölder continuous near the boundary if $0<\gamma <3$ and fails to be locally $\gamma $-Hölder continuous if $\gamma >3$.
</p>projecteuclid.org/euclid.ecp/1559700464_20190604220755Tue, 04 Jun 2019 22:07 EDTSensitivity of the frog model to initial conditionshttps://projecteuclid.org/euclid.ecp/1559700465<strong>Tobias Johnson</strong>, <strong>Leonardo T. Rolla</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 9 pp..</p><p><strong>Abstract:</strong><br/>
The frog model is an interacting particle system on a graph. Active particles perform independent simple random walks, while sleeping particles remain inert until visited by an active particle. Some number of sleeping particles are placed at each site sampled independently from a certain distribution, and then one particle is activated to begin the process. We show that the recurrence or transience of the model is sensitive not just to the expectation but to the entire distribution. This is in contrast to closely related models like branching random walk and activated random walk.
</p>projecteuclid.org/euclid.ecp/1559700465_20190604220755Tue, 04 Jun 2019 22:07 EDTRigidity for zero sets of Gaussian entire functionshttps://projecteuclid.org/euclid.ecp/1559700466<strong>Avner Kiro</strong>, <strong>Alon Nishry</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 9 pp..</p><p><strong>Abstract:</strong><br/>
In this note we consider a certain class of Gaussian entire functions, characterized by some asymptotic properties of their covariance kernels, which we call admissible (as defined by Hayman). A notable example is the Gaussian Entire Function, whose zero set is well-known to be invariant with respect to the isometries of the complex plane.
We explore the rigidity of the zero set of Gaussian Taylor series, a phenomenon discovered not long ago by Ghosh and Peres for the Gaussian Entire Function. In particular, we find that for a function of infinite order of growth, and having an admissible kernel, the zero set is “fully rigid”. This means that if we know the location of the zeros in the complement of any given compact set, then the number and location of the zeros inside that set can be determined uniquely. As far as we are aware, this is the first explicit construction in a natural class of random point processes with full rigidity.
</p>projecteuclid.org/euclid.ecp/1559700466_20190604220755Tue, 04 Jun 2019 22:07 EDTGrowing in time IDLA cluster is recurrenthttps://projecteuclid.org/euclid.ecp/1560391477<strong>Ruojun Huang</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 11 pp..</p><p><strong>Abstract:</strong><br/>
We show that Internal Diffusion Limited Aggregation (IDLA )on $\mathbb{Z} ^{d}$ has near optimal Cheeger constant when the growing cluster is large enough. This implies, through a heat kernel lower bound derived previously in [11], that simple random walk evolving independently on growing in time IDLA cluster is recurrent when $d\ge 3$.
</p>projecteuclid.org/euclid.ecp/1560391477_20190612220451Wed, 12 Jun 2019 22:04 EDTAn upper bound for the probability of visiting a distant point by a critical branching random walk in $\mathbb{Z} ^{4}$https://projecteuclid.org/euclid.ecp/1560477644<strong>Qingsan Zhu</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 6 pp..</p><p><strong>Abstract:</strong><br/>
In this paper, we study the probability of visiting a distant point $a\in \mathbb{Z} ^{4}$ by a critical branching random walk starting at the origin. We prove that this probability is bounded by $1/(|a|^{2}\log |a|)$ up to a constant factor.
</p>projecteuclid.org/euclid.ecp/1560477644_20190613220112Thu, 13 Jun 2019 22:01 EDTOn the martingale property in the rough Bergomi modelhttps://projecteuclid.org/euclid.ecp/1560477645<strong>Paul Gassiat</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 9 pp..</p><p><strong>Abstract:</strong><br/>
We consider a class of fractional stochastic volatility models (including the so-called rough Bergomi model), where the volatility is a superlinear function of a fractional Gaussian process. We show that the stock price is a true martingale if and only if the correlation $\rho $ between the driving Brownian motions of the stock and the volatility is nonpositive. We also show that for each $\rho <0$ and $m> \frac{1} {{1-\rho ^{2}}}$, the $m$-th moment of the stock price is infinite at each positive time.
</p>projecteuclid.org/euclid.ecp/1560477645_20190613220112Thu, 13 Jun 2019 22:01 EDTBerry-Esseen bounds in the Breuer-Major CLT and Gebelein’s inequalityhttps://projecteuclid.org/euclid.ecp/1561169050<strong>Ivan Nourdin</strong>, <strong>Giovanni Peccati</strong>, <strong>Xiaochuan Yang</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 12 pp..</p><p><strong>Abstract:</strong><br/>
We derive explicit Berry-Esseen bounds in the total variation distance for the Breuer-Major central limit theorem, in the case of a subordinating function $\varphi $ satisfying minimal regularity assumptions. Our approach is based on the combination of the Malliavin-Stein approach for normal approximations with Gebelein’s inequality, bounding the covariance of functionals of Gaussian fields in terms of maximal correlation coefficients.
</p>projecteuclid.org/euclid.ecp/1561169050_20190621220425Fri, 21 Jun 2019 22:04 EDTLarge deviations of the long term distribution of a non Markov processhttps://projecteuclid.org/euclid.ecp/1561169051<strong>Anatolii Puhalskii</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 11 pp..</p><p><strong>Abstract:</strong><br/>
We prove that the long term distribution of the queue length process in an ergodic generalised Jackson network obeys the Large Deviation Principle with a deviation function given by the quasipotential. The latter is related to the unique long term idempotent distribution, which is also a stationary idempotent distribution, of the large deviation limit of the queue length process. The proof draws on developments in queueing network stability and idempotent probability.
</p>projecteuclid.org/euclid.ecp/1561169051_20190621220425Fri, 21 Jun 2019 22:04 EDTKemeny’s constant for one-dimensional diffusionshttps://projecteuclid.org/euclid.ecp/1561169052<strong>Ross Pinsky</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 5 pp..</p><p><strong>Abstract:</strong><br/>
Let $X(\cdot )$ be a non-degenerate, positive recurrent one-dimensional diffusion process on $\mathbb{R} $ with invariant probability density $\mu (x)$, and let $\tau _{y}=\inf \{t\ge 0: X(t)=y\}$ denote the first hitting time of $y$. Let $\mathcal{X} $ be a random variable independent of the diffusion process $X(\cdot )$ and distributed according to the process’s invariant probability measure $\mu (x)dx$. Denote by $\mathcal{E} ^{\mu }$ the expectation with respect to $\mathcal{X} $. Consider the expression \[ \mathcal{E} ^{\mu }E_{x}\tau _{\mathcal{X} }=\int _{-\infty }^{\infty }(E_{x}\tau _{y})\mu (y)dy, \ x\in \mathbb{R} . \] In words, this expression is the expected hitting time of the diffusion starting from $x$ of a point chosen randomly according to the diffusion’s invariant distribution. We show that this expression is constant in $x$, and that it is finite if and only if $\pm \infty $ are entrance boundaries for the diffusion. This result generalizes to diffusion processes the corresponding result in the setting of finite Markov chains, where the constant value is known as Kemeny’s constant.
</p>projecteuclid.org/euclid.ecp/1561169052_20190621220425Fri, 21 Jun 2019 22:04 EDTRotatable random sequences in local fieldshttps://projecteuclid.org/euclid.ecp/1561169053<strong>Steven N. Evans</strong>, <strong>Daniel Raban</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 12 pp..</p><p><strong>Abstract:</strong><br/>
An infinite sequence of real random variables $(\xi _{1}, \xi _{2}, \dots )$ is said to be rotatable if every finite subsequence $(\xi _{1}, \dots , \xi _{n})$ has a spherically symmetric distribution. A celebrated theorem of Freedman states that $(\xi _{1}, \xi _{2}, \dots )$ is rotatable if and only if $\xi _{j} = \tau \eta _{j}$ for all $j$, where $(\eta _{1}, \eta _{2}, \dots )$ is a sequence of independent standard Gaussian random variables and $\tau $ is an independent nonnegative random variable. Freedman’s theorem is equivalent to a classical result of Schoenberg which says that a continuous function $\phi : \mathbb{R} _{+} \to \mathbb{C} $ with $\phi (0) = 1$ is completely monotone if and only if $\phi _{n}: \mathbb{R} ^{n} \to \mathbb{R} $ given by $\phi _{n}(x_{1}, \ldots , x_{n}) = \phi (x_{1}^{2} + \cdots + x_{n}^{2})$ is nonnegative definite for all $n \in \mathbb{N} $. We establish the analogue of Freedman’s theorem for sequences of random variables taking values in local fields using probabilistic methods and then use it to establish a local field analogue of Schoenberg’s result. Along the way, we obtain a local field counterpart of an observation variously attributed to Maxwell, Poincaré, and Borel which says that if $(\zeta _{1}, \ldots , \zeta _{n})$ is uniformly distributed on the sphere of radius $\sqrt{n} $ in $\mathbb{R} ^{n}$, then, for fixed $k \in \mathbb{N} $, the distribution of $(\zeta _{1}, \ldots , \zeta _{k})$ converges to that of a vector of $k$ independent standard Gaussian random variables as $n \to \infty $.
</p>projecteuclid.org/euclid.ecp/1561169053_20190621220425Fri, 21 Jun 2019 22:04 EDTWeighted graphs and complex Gaussian free fieldshttps://projecteuclid.org/euclid.ecp/1561169054<strong>Gregory F. Lawler</strong>, <strong>Petr Panov</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 9 pp..</p><p><strong>Abstract:</strong><br/>
We prove a combinatorial statement about the distribution of directed currents in a complex “loop soup” and use it to give a new proof of the isomorphism, which relates loop measures and complex Gaussian free fields.
</p>projecteuclid.org/euclid.ecp/1561169054_20190621220425Fri, 21 Jun 2019 22:04 EDTPhase transitions for edge-reinforced random walks on the half-linehttps://projecteuclid.org/euclid.ecp/1561169055<strong>Jiro Akahori</strong>, <strong>Andrea Collevecchio</strong>, <strong>Masato Takei</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 12 pp..</p><p><strong>Abstract:</strong><br/>
We study the behaviour of a class of edge-reinforced random walks on $\mathbb{Z} _{+}$, with heterogeneous initial weights, where each edge weight can be updated only when the edge is traversed from left to right. We provide a description for different behaviours of this process and describe phase transitions that arise as trade-offs between the strength of the reinforcement and that of the initial weights. Our result aims to complete the ones given by Davis [3, 4], Takeshima [9, 10] and Vervoort [11].
</p>projecteuclid.org/euclid.ecp/1561169055_20190621220425Fri, 21 Jun 2019 22:04 EDTOn Markovian random networkshttps://projecteuclid.org/euclid.ecp/1562119368<strong>Yves Le Jan</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 7 pp..</p><p><strong>Abstract:</strong><br/>
We investigate the relation to random configurations and combinatorial maps of the Eulerian networks defined by Poissonian emsembles of Markov loops.
</p>projecteuclid.org/euclid.ecp/1562119368_20190702220317Tue, 02 Jul 2019 22:03 EDTConvergence of complex martingale for a branching random walk in a time random environmenthttps://projecteuclid.org/euclid.ecp/1562119369<strong>Xiaoqiang Wang</strong>, <strong>Chunmao Huang</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 14 pp..</p><p><strong>Abstract:</strong><br/>
We consider a discrete-time branching random walk in a stationary and ergodic environment $\xi =(\xi _{n})$ indexed by time $n\in \mathbb{N} $. Let $W_{n}(z)$ ($z\in \mathbb{C} ^{d}$) be the natural complex martingale of the process. We show sufficient conditions for its almost sure and quenched $L^{\alpha }$ convergence, as well as the existence of quenched moments and weighted moments of its limit, and also describe the exponential convergence rate.
</p>projecteuclid.org/euclid.ecp/1562119369_20190702220317Tue, 02 Jul 2019 22:03 EDTAbsolute continuity of the martingale limit in branching processes in random environmenthttps://projecteuclid.org/euclid.ecp/1562119370<strong>Ewa Damek</strong>, <strong>Nina Gantert</strong>, <strong>Konrad Kolesko</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 13 pp..</p><p><strong>Abstract:</strong><br/>
We consider a supercritical branching process $Z_{n}$ in a stationary and ergodic random environment $\xi =(\xi _{n})_{n\ge 0}$. Due to the martingale convergence theorem, it is known that the normalized population size $W_{n}=Z_{n}/(\mathbb{E} [Z_{n}|\xi ])$ converges almost surely to a random variable $W$. We prove that if $W$ is not concentrated at $0$ or $1$ then for almost every environment $\xi $ the law of $W$ conditioned on the environment $\xi $ is absolutely continuous with a possible atom at $0$. The result generalizes considerably the main result of [10], and of course it covers the well-known case of the martingale limit of a Galton-Watson process. Our proof combines analytical arguments with the recursive description of $W$.
</p>projecteuclid.org/euclid.ecp/1562119370_20190702220317Tue, 02 Jul 2019 22:03 EDTProjections of scaled Bessel processshttps://projecteuclid.org/euclid.ecp/1562119371<strong>Constantinos Kardaras</strong>, <strong>Johannes Ruf</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 11 pp..</p><p><strong>Abstract:</strong><br/>
Let $X$ and $Y$ denote two independent squared Bessel processes of dimension $m$ and $n-m$, respectively, with $n\geq 2$ and $m \in [0, n)$, making $X+Y$ a squared Bessel process of dimension $n$. For appropriately chosen function $s$, the process $s (X+Y)$ is a local martingale. We study the representation and the dynamics of $s(X+Y)$, projected on the filtration generated by $X$. This projection is a strict supermartingale if, and only if, $m<2$. The finite-variation term in its Doob-Meyer decomposition only charges the support of the Markov local time of $X$ at zero.
</p>projecteuclid.org/euclid.ecp/1562119371_20190702220317Tue, 02 Jul 2019 22:03 EDTProbability to be positive for the membrane model in dimensions 2 and 3https://projecteuclid.org/euclid.ecp/1562292105<strong>Simon Buchholz</strong>, <strong>Jean-Dominique Deuschel</strong>, <strong>Noemi Kurt</strong>, <strong>Florian Schweiger</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 14 pp..</p><p><strong>Abstract:</strong><br/>
We consider the membrane model on a box $V_{N}\subset \mathbb{Z} ^{n}$ of size $(2N+1)^{n}$ with zero boundary condition in the subcritical dimensions $n=2$ and $n=3$. We show optimal estimates for the probability that the field is positive in a subset $D_{N}$ of $V_{N}$. In particular we obtain for $D_{N}=V_{N}$ that the probability to be positive on the entire domain is exponentially small and the rate is of the order of the surface area $N^{n-1}$.
</p>projecteuclid.org/euclid.ecp/1562292105_20190704220214Thu, 04 Jul 2019 22:02 EDTUpper tail large deviations in Brownian directed percolationhttps://projecteuclid.org/euclid.ecp/1562292106<strong>Christopher Janjigian</strong>. <p><strong>Source: </strong>Electronic Communications in Probability, Volume 24, 10 pp..</p><p><strong>Abstract:</strong><br/>
This paper presents a new, short proof of the computation of the upper tail large deviation rate function for the Brownian directed percolation model. Through a distributional equivalence between the last passage time in this model and the largest eigenvalue in a random matrix drawn from the Gaussian Unitary Ensemble, this provides a new proof of a previously known result. The method leads to associated results for the stationary Brownian directed percolation model which have not been observed before.
</p>projecteuclid.org/euclid.ecp/1562292106_20190704220214Thu, 04 Jul 2019 22:02 EDT