Percolation on graphs of polynomial growth is local: analyticity, supercritical sharpness, isoperimetry
S\'ebastien Martineau, Christoforos Panagiotis

TL;DR
This paper demonstrates that in transitive graphs with polynomial growth, supercritical percolation properties are local and can be inferred from similar graphs with matching local structure, establishing analyticity and sharpness results.
Contribution
It proves locality of supercritical percolation behavior on polynomial growth graphs and introduces new connectivity results for minimal cutsets, answering a longstanding question.
Findings
Percolation quantities are locally determined on similar graphs.
The percolation probability function is analytic in the supercritical regime.
New connectivity results for minimal cutsets are established.
Abstract
We investigate locality of the supercritical regime for Bernoulli percolation on transitive graphs with polynomial growth, by which we mean the following. Take a transitive graph of polynomial growth satisfying and take . Let be another such graph and assume that and have the same ball of radius for large. We prove that various quantities regarding percolation of parameter close to on can be well understood from alone. This includes uniform versions of supercritical sharpness as well as the Kesten-Zhang bound on the probability of observing a large finite cluster: the constants involved can be chosen to depend only on . We also prove that is an analytic function of in the whole supercritical regime and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Theoretical and Computational Physics · Markov Chains and Monte Carlo Methods
