Finite touching sets between percolation clusters on grandparent graphs
A transitive graph exhibits cluster repulsion at the parameter $p$ if, almost surely, any two distinct clusters of Bernoulli bond percolation with parameter $p$ are joined by only finitely many edges. Timár proved cluster repulsion for every unimodular quasi-transitive graph and every $p$, and the nonunimodular case is open. Bell, Chu, Rodgers, Terlov and Tserunyan proved that on nonunimodular graphs the touching sets have finite modular weight, which leaves open whether two light clusters can touch along infinitely many edges. We prove cluster repulsion at every $p\in[0,1]$ for the grandparent graphs $\mathrm{GP}_b$, $b\ge2$, the standard transitive nonunimodular examples, whose infinite clusters are light for $1/b<p<1$. The proof shows that every two-point function $p\mapsto\mathbb{P}_p(u\leftrightarrow v)$ is continuous on $(0,1)$, by integrating out each descendant cone through an exact one-variable equation and bounding the effect of the missing ancestors uniformly in $p$, and then applies the sprinkling argument of Häggström, Peres and Schonmann.
Authors
- Yitzchak Shmalo (ORCID: https://orcid.org/0000-0002-2886-3049)
Institutions
- Hebrew University of Jerusalem (IL)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-13
- DOI
- https://doi.org/10.5281/zenodo.24192743
- Primary Topic
- Stochastic processes and statistical mechanics
- Type
- preprint