Locality of percolation critical probabilities: uniformly nonamenable case

Abstract

Let \Gn\n=1∞ be a sequence of transitive infinite connected graphs with n≥ 1 pc(Gn) < 1, where each pc(Gn) is bond percolation critical probability on Gn. Schramm (2008) conjectured that if Gn converges locally to a transitive infinite connected graph G, then pc(Gn) → pc(G) as n→∞. We prove the conjecture when G satisfies two rough uniformities, and \Gn\n=1∞ is uniformly nonamenable.

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…