English
Related papers

Related papers: Central limit theorem for first-passage percolatio…

200 papers

Let $G$ be a group with a non-elementary action on a proper CAT(0) space $X$, and let $\mu$ be a measure on $G$ such that the random walk $(Z_n)_n$ generated by $\mu$ has finite second moment on $X$. Let $o$ be a basepoint in $X$, and…

Group Theory · Mathematics 2024-07-31 Corentin Le Bars

We study lower and upper bounds for the density of a diffusion process in ${\mathbb{R}}^n$ in a small (but not asymptotic) time, say $\delta$. We assume that the diffusion coefficients $\sigma_1,\ldots,\sigma_d$ may degenerate at the…

Probability · Mathematics 2019-12-03 Vlad Bally , Lucia Caramellino , Paolo Pigato

We are interested in a fragmentation process. We observe fragments frozen when their sizes are less than {\epsilon} ({\epsilon} > 0). It is known ([BM05]) that the empirical measure of these fragments converges in law, under some…

Probability · Mathematics 2022-10-17 Camille Noûs , Sylvain Rubenthaler

In this note we study the error term R_{n,L}(x) in the generalized circle problem for a ball of volume x and a random lattice L of large dimension n. Our main result is the following functional central limit theorem: Fix an arbitrary…

Number Theory · Mathematics 2016-11-22 Andreas Strömbergsson , Anders Södergren

It is well known that central order statistics exhibit a central limit behavior and converge to a Gaussian distribution as the sample size grows. This paper strengthens this known result by establishing an entropic version of the CLT that…

Information Theory · Computer Science 2022-05-11 Martina Cardone , Alex Dytso , Cynthia Rush

For $a>0$ and $b \geq 0$, let $\mathbb{G}_{a,b}$ be the subgraph of $\mathbb{Z}^2$ induced by the vertices between the first coordinate axis and the graph of the function $f = f_{a,b}(u) = a \log (1+u) + b \log(1+\log(1+u))$, $u \geq 0$. It…

Probability · Mathematics 2025-03-07 Michael Damron , Wai-Kit Lam

Let $(\tau_n)$ be a sequence of toral automorphisms $\tau_n : x \rightarrow A_n x \hbox{mod}\ZZ^d$ with $A_n \in {\cal A}$, where ${\cal A}$ is a finite set of matrices in $SL(d, \mathbb{Z})$. Under some conditions the method of…

Probability · Mathematics 2010-06-22 Jean-Pierre Conze , Stéphane Le Borgne , Mikaël Roger

The theorem of Dekking and Host regarding tightness around the mean of first passage percolation on the binary tree, from the root to a boundary of a ball, is generalized to a class of graphs which includes all lattices in hyperbolic spaces…

Probability · Mathematics 2010-11-15 Itai Benjamini , Ofer Zeitouni

We show central limit theorems (CLT) for the Stieltjes transforms or more general analytic functions of symmetric matrices with independent heavy tailed entries, including entries in the domain of attraction of $\alpha$-stable laws and…

Probability · Mathematics 2015-06-12 Florent Benaych-Georges , Alice Guionnet , Camille Male

The Central Limit Theorem (CLT) is one of the most fundamental results in statistics. It states that the standardized sample mean of a sequence of $n$ mutually independent and identically distributed random variables with finite first and…

The Central Limit Theorem (CLT) for extrinsic and intrinsic means on manifolds is extended to a generalization of Fr\'echet means. Examples are the Procrustes mean for 3D Kendall shapes as well as a mean introduced by Ziezold. This allows…

Methodology · Statistics 2015-03-13 Stephan Huckemann

We introduce a new first passage percolation model in a Poissonian environment on $\mathbb{R}^{2}$. In this model, the action of a path depends on the geometry of the path and the travel time. We prove that the transversal fluctuation…

Probability · Mathematics 2016-05-20 Yuri Bakhtin , Wei Wu

We prove central limit theorems (CLTs) for topological functionals of Bernoulli bond percolation on infinite graphs beyond the Euclidean lattice $\mathbb{Z}^{d}$. For quasi-transitive graphs of subexponential growth, we show that the number…

Probability · Mathematics 2026-04-10 Luciano H. L. de Araújo , Daniel Miranda Machado , Cristian F. Coletti

Benjamini, Finucane and the first author have shown that if (G_n,S_n) is a sequence of Cayley graphs such that |S_n^n|=O(n^D|S_n|), then the sequence (G_n,d_{S_n}/n) is relatively compact for the Gromov-Hausdorff topology and every cluster…

Group Theory · Mathematics 2018-06-15 Romain Tessera , Matthew Tointon

In this paper we consider a branching particle system consisting of particles moving according to the Ornstein-Uhlenbeck process in $\Rd$ and undergoing a binary, supercritical branching with a constant rate $\lambda>0$. This system is…

Probability · Mathematics 2011-11-23 Radosław Adamczak , Piotr Miłoś

Internal DLA is a discrete random growth model describing growing clusters of particles. Its limiting shape and fluctuations are well understood when the underlying graph is the $d$-dimensional lattice or the cylinder $\mathbb{Z}_N \times…

Probability · Mathematics 2026-04-24 Ahmed Bou-Rabee , Vittoria Silvestri , Ariel Yadin

Consider first passage percolation on $\mathbb{Z}^d$ with passage times given by i.i.d. random variables with common distribution $F$. Let $t_\pi(u,v)$ be the time from $u$ to $v$ for a path $\pi$ and $t(u,v)$ the minimal time among all…

Probability · Mathematics 2013-12-30 Enrique D. Andjel , Maria Eulalia Vares

In first-passage percolation, one places nonnegative i.i.d. random variables (T (e)) on the edges of Z d. A geodesic is an optimal path for the passage times T (e). Consider a local property of the time environment. We call it a pattern. We…

Probability · Mathematics 2023-03-09 Antonin Jacquet

The main result of this paper is a functional limit theorem for the sine-process. In particular, we study the limit distribution, in the space of trajectories, for the number of particles in a growing interval. The sine-process has the…

Dynamical Systems · Mathematics 2018-01-12 Alexander I. Bufetov , Andrey V. Dymov

We show a central limit theorem for random walk on a Galton-Watson tree, when the edges of the tree are assigned randomly uniformly elliptic conductances. When a positive fraction of edges is assigned a small conductance $\varepsilon$, we…

Probability · Mathematics 2024-10-14 Tabea Glatzel , Jan Nagel
‹ Prev 1 4 5 6 7 8 10 Next ›