Family 214Probability and statistical mechanicsNo LeanNot yet digested
The Benjamini–Schramm nonuniqueness conjecture
Proves for Bernoulli bond percolation on every infinite connected locally finite nonamenable quasi-transitive graph, resolving the Benjamini–Schramm nonuniqueness conjecture. Thus there is a nonempty range of probabilities with infinitely many infinite clusters. A stronger operator bound also establishes the critical triangle condition.
Manuscripts in this family · 1
Nonuniqueness of percolation on nonamenable quasi-transitive graphs
Sep 24, 2026·paper.pdf
We prove the bond-percolation nonuniqueness conjecture of Benjamini and Schramm: every infinite connected, locally finite, nonamenable quasi-transitive graph has a nonempty interval of parameters for which Bernoulli bond percolation almost surely has infinitely many infinite clusters. We also prove Hutchcroft's stronger operator-threshold conjecture, establishing .