The critical percolation probability is local

Abstract

We prove Schramm's locality conjecture for Bernoulli bond percolation on transitive graphs: If (Gn)n≥ 1 is a sequence of infinite vertex-transitive graphs converging locally to a vertex-transitive graph G and pc(Gn) ≠ 1 for every n ≥ 1 then n∞ pc(Gn)=pc(G). Equivalently, the critical probability pc defines a continuous function on the space G* of infinite vertex-transitive graphs that are not one-dimensional. As a corollary of the proof, we obtain a new proof that pc(G)<1 for every infinite vertex-transitive graph that is not one-dimensional.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…