Sharpness and locality for percolation on finite transitive graphs

Abstract

Let (Gn) = ((Vn,En)) be a sequence of finite connected vertex-transitive graphs with uniformly bounded vertex degrees such that Vn ∞ as n ∞. We say that percolation on Gn has a sharp phase transition (as n ∞) if, as the percolation parameter crosses some critical point, the number of vertices contained in the largest percolation cluster jumps from logarithmic to linear order with high probability. We prove that percolation on Gn has a sharp phase transition unless, after passing to a subsequence, the rescaled graph-metric on Gn (rapidly) converges to the unit circle with respect to the Gromov-Hausdorff metric. We deduce that under the same hypothesis, the critical point for the emergence of a giant (i.e. linear-sized) cluster in Gn coincides with the critical point for the emergence of an infinite cluster in the Benjamini-Schramm limit of (Gn), when this limit exists.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…