First Passage Percolation Has Sublinear Distance Variance
Itai Benjamini, Gil Kalai, Oded Schramm
Abstract
Let 0<a<b<∞, and for each edge e of Zd let ωe=a or ωe=b, each with probability 1/2, independently. This induces a random metric ω on the vertices of Zd, called first passage percolation. We prove that for d>1 the distance distω(0,v) from the origin to a vertex v, |v|>2, has variance bounded by C |v|/|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
Create a lesson
Related papers
Sandpile avalanches in two dimensions are finite
Ahmed Bou-Rabee
Markov Chain Convergence in Kernel-Induced Geometry
Oleksii Kachaiev, Luc Brogat-Motte, Silvia Villa et al.
Interacting Stochastic Systems with Agent-Based Sampling and Connection-Based Reinforcement
Yogesh Dahiya, Gursharn Kaur, Neeraja Sahasrabudhe
Dimension-free Markov--Bernstein-type inequality for R2-valued polynomials
Egor Kosov
Initialization-Dependent Solution Selection by the Euler-Maruyama Scheme for a Degenerate SDE
Akihiro Tanaka
Statistical inference for rough Burgers-type stochastic partial differential equations
Simon Chony Acosta Christian Olivera Ciprian Tudor