Slightly supercritical percolation on nonamenable graphs II: Growth and isoperimetry of infinite clusters
Tom Hutchcroft

TL;DR
This paper investigates the growth and isoperimetric properties of infinite clusters in slightly supercritical Bernoulli bond percolation on nonamenable graphs, revealing exponential volume growth and precise estimates near the critical probability.
Contribution
It establishes that infinite clusters exhibit purely exponential volume growth under certain conditions and provides precise growth rate estimates near the critical point, extending understanding of percolation on nonamenable graphs.
Findings
Volume growth of infinite clusters is purely exponential.
Precise estimates for cluster volume near critical probability.
Quenched and annealed growth rates coincide in the supercritical regime.
Abstract
We study the growth and isoperimetry of infinite clusters in slightly supercritical Bernoulli bond percolation on transitive nonamenable graphs under the boundedness condition (). Surprisingly, we find that the volume growth of infinite clusters is always purely exponential (that is, the subexponential corrections to growth are bounded) in the regime , even when the ambient graph has unbounded corrections to exponential growth. For slightly larger than , we establish the precise estimates \begin{align*} \mathbf{E}_p \left[ \# B_\mathrm{int}(v,r) \right] &\asymp \left(r \wedge \frac{1}{p-p_c} \right)^{\phantom{2}} e^{\gamma_\mathrm{int}(p) r} \\ \mathbf{E}_p \left[ \# B_\mathrm{int}(v,r) \mid v \leftrightarrow \infty \right] &\asymp \left(r \wedge \frac{1}{p-p_c} \right)^2 e^{\gamma_\mathrm{int}(p) r} \end{align*} for every , $r…
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
