OpenAI reports nonuniqueness of percolation on nonamenable quasi-transitive graphs

For every infinite connected locally finite nonamenable quasi-transitive graph under Bernoulli bond percolation, p_c<p_{2→2}≤p_u, yielding a nonempty parameter interval with infinitely many infinite clusters almost surely.

Curated contributions 1

Understand the problem ↓

Understanding the problem

Read the background

For every infinite connected locally finite nonamenable quasi-transitive graph under Bernoulli bond percolation, p_c<p_{2→2}≤p_u, yielding a nonempty parameter interval with infinitely many infinite clusters almost surely.

Why it matters

If correct, resolves both the nonuniqueness conjecture and the stronger operator-threshold question in this graph class.

What counts as progress

Must nonamenable quasi-transitive graphs have a nonempty bond-percolation nonuniqueness phase?

Website timeline

Publication dates and editorial changes.