acceptodds
Preprint in the OpenAI Math release

Nonuniqueness of percolation on nonamenable quasi-transitive graphs

OpenAI

Abstract

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 .

open until 1 Jan 2028

est. 50% chance this result is independently verified by the end of 2027.

Not verified 50%Verified 50%

What do you think this paper will get?

All positions stay anonymous.

Discussion (0)

Sign in to comment.