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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Finite touching sets between percolation clusters on grandparent graphs

Yitzchak Shmalo
Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
preprint

Finite touching sets between percolation clusters on grandparent graphs

Yitzchak Shmalo
preprint en

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon