arXiv:math/0203262 [math.PR]AbstractReferencesReviewsResources
First Passage Percolation Has Sublinear Distance Variance
Itai Benjamini, Gil Kalai, Oded Schramm
Published 2002-03-25, updated 2007-05-25Version 5
Let $0<a<b<\infty$, and for each edge $e$ of $Z^d$ let $\omega_e=a$ or $\omega_e=b$, each with probability 1/2, independently. This induces a random metric $\dist_\omega$ on the vertices of $Z^d$, called first passage percolation. We prove that for $d>1$ the distance $dist_\omega(0,v)$ from the origin to a vertex $v$, $|v|>2$, has variance bounded by $C |v|/\log|v|$, where $C=C(a,b,d)$ is a constant which may only depend on $a$, $b$ and $d$. Some related variants are also discussed
Comments: Replaced theorem 2 (which was incorrect) by a new theorem
Journal: AnnalsProbab.31:197-1978,2003
Keywords: first passage percolation, sublinear distance variance, random metric, probability, related variants
Tags: journal article
Related articles: Most relevant | Search more
Singularity points for first passage percolation
arXiv:2309.03880 [math.PR] (Published 2023-09-07)
First passage percolation, local uniqueness for interlacements and capacity of random walk
First passage percolation with long-range correlations and applications to random Schrödinger operators