The variance of the graph distance in the infinite cluster of percolation is sublinear

preprint2022arXivOpen access

Abstract

We consider the standard model of i.i.d. bond percolation on Zd\mathbb Z^d of parameter pp. When p>pcp>p_c, there exists almost surely a unique infinite cluster Cp\mathcal C_p. Using the recent techniques of Cerf and Dembin, we prove that the variance of the graph distance in Cp\mathcal C_p between two points of Cp\mathcal C_p is sublinear. The main result extends the works of Benjamini, Kalai and Schramm, Benaim and Rossignol and Damron, Hanson and Sosoe for the study of the variance of passage times in first passage percolation without moment conditions on the edge-weight distribution.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.