Anchored isoperimetry in percolation
math.PR, math.CO
Submitted: 2026-10-28
Updated: 2026-10-28
Comments: 11 pages, 2 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: We show that, for any infinite transitive graph G, the infinite cluster after supercritical percolation almost surely inherits the anchored isoperimetry of G.
Abstract
We show that, for any infinite transitive graph G, the infinite cluster after supercritical percolation almost surely inherits the anchored isoperimetry of G. Moreover, the probability of violating the corresponding isoperimetric inequality decays exponentially in the isoperimetric profile of the host graph. This was previously known only for nonamenable transitive graphs, Z d, and very recently for transitive graphs of polynomial growth. Our proof combines the thinning-and-sprinkling technique with a novel counting algorithm.
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves
- A zero-one law for swap-invariant events in uniform spanning forests
- Bernoulli flow for Erd s-R'enyi graphs