Paperlane

no. 10 · Friday 6 November 2026

Heavy repulsion of clusters in Bernoulli percolation

Sasha Bell, Tasmin Chu, Owen Rodgers, Grigory Terlov and Anush Tserunyan

math.PR · v2 · 24 pp

Abstract

We consider Bernoulli$(p)$ percolation on (non)unimodular quasi-transitive graphs and prove that, almost surely, for any two clusters $C$ and $C'$, the set of vertices in $C$ within distance one of $C'$ is light, i.e.\ it has finite total modular weight. This is a significant step towards resolving a longstanding question of Häggström, Peres, and Schonmann, and a generalization of a theorem of Timár, who proved the same result in the unimodular setting. We present two proofs. The first one is a hyperfiniteness argument that is specific to Bernoulli$(p)$ percolation and is new even in the unimodular case; the second is more general and follows Timár's approach, but requires the development of weighted analogues of several classical unimodular results. The new insight in both proofs is nonhyperfiniteness, which we obtain from the recently developed theory of measure class preserving equivalence relations and graphs. In particular, along the way we establish a generalization of a theorem of Benjamini, Lyons, and Schramm on the existence of an invariant random subgraph with positive weighted Cheeger constant, which is of independent interest.

comments
24 pages, 3 figures. Added a new proof and improved presentation
fields
Probability, Dynamical Systems
pdf ↗ page arXiv:2509.10631 ↗