Locality of percolation for graphs with polynomial growth

preprint2022arXivOpen access

Abstract

Schramm's Locality Conjecture asserts that the value of the critical percolation parameter pcp_c of a graph satisfying pc<1p_c<1 depends only on its local structure. In this note, we prove this conjecture in the particular case of transitive graphs with polynomial growth. Our proof relies on two recent works about such graphs, namely supercritical sharpness of percolation by the same authors and a finitary structure theorem by Tessera and Tointon.

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.