probability-statistics / Percolation on nonamenable graphs

The Benjamini-Schramm nonuniqueness conjecture: p_c < p_u for bond percolation on nonamenable quasi-transitive graphs

Theorem 1.1: for every infinite connected locally finite quasi-transitive graph with positive vertex isoperimetric constant, sup⁡p<pc∥Tp∥2→2=∥Tpc∥2→2<∞\sup_{p<p_c}\|T_p\|_{2\to2}=\|T_{p_c}\|_{2\to2}<\infty and pc<p2→2≤pup_c<p_{2\to2}\le p_u; there are pc<p1<p2<1p_c<p_1<p_2<1 such that, in the uniform-label coupling, almost surely infinitely many infinite clusters exist simultaneously for all p∈[p1,p2]p\in[p_1,p_2]. Corollary 1.2 gives the same for every finite symmetric generating set of every nonamenable finitely generated group. Further consequences: the triangle condition at pcp_c, mean-field critical exponents, and exponential decay of connections below p2→2p_{2\to2}. It concerns bond percolation only; the site-percolation form of the conjecture and the related pu<1p_u<1 question for one-ended graphs are not addressed. Constants and the interval depend on GG.

66Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

probability-statisticsSep 24, 2026Significance 66/100Registry: lean checked

The Benjamini-Schramm nonuniqueness conjecture: p_c < p_u for bond percolation on nonamenable quasi-transitive graphs

Prior state unknown→proved

Theorem 1.1: for every infinite connected locally finite quasi-transitive graph with positive vertex isoperimetric constant, sup⁡p<pc∥Tp∥2→2=∥Tpc∥2→2<∞\sup_{p<p_c}\|T_p\|_{2\to2}=\|T_{p_c}\|_{2\to2}<\infty and pc<p2→2≤pup_c<p_{2\to2}\le p_u; there are pc<p1<p2<1p_c<p_1<p_2<1 such that, in the uniform-label coupling, almost surely infinitely many infinite clusters exist simultaneously for all p∈[p1,p2]p\in[p_1,p_2]. Corollary 1.2 gives the same for every finite s…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: for every infinite connected locally finite quasi-transitive graph with positive vertex isoperimetric constant, sup⁡p<pc∥Tp∥2→2=∥Tpc∥2→2<∞\sup_{p<p_c}\|T_p\|_{2\to2}=\|T_{p_c}\|_{2\to2}<\infty and pc<p2→2≤pup_c<p_{2\to2}\le p_u; there are pc<p1<p2<1p_c<p_1<p_2<1 such that, in the uniform-label coupling, almost surely infinitely many infinite clusters exist simultaneously for all p∈[p1,p2]p\in[p_1,p_2]. Corollary 1.2 gives the same for every finite symmetric generating set of every nonamenable finitely generated group. Further consequences: the triangle condition at pcp_c, mean-field critical exponents, and exponential decay of connections below p2→2p_{2\to2}. It concerns bond percolation only; the site-percolation form of the conjecture and the related pu<1p_u<1 question for one-ended graphs are not addressed. Constants and the interval depend on GG.

Theorem 1.1: for every infinite connected locally finite quasi-transitive graph with positive vertex isoperimetric constant, sup⁡p<pc∥Tp∥2→2=∥Tpc∥2→2<∞\sup_{p<p_c}\|T_p\|_{2\to2}=\|T_{p_c}\|_{2\to2}<\infty and pc<p2→2≤pup_c<p_{2\to2}\le p_u; there are pc<p1<p2<1p_c<p_1<p_2<1 such that, in the uniform-label coupling, almost surely infinitely many infinite clusters exist simultaneously for all p∈[p1,p2]p\in[p_1,p_2]. Corollary 1.2 gives the same for every finite symmetric generating set of every nonamenable finitely generated group. Further consequences: the triangle condition at pcp_c, mean-field critical exponents, and exponential decay of connections below p2→2p_{2\to2}. It concerns bond percolation only; the site-percolation form of the conjecture and the related pu<1p_u<1 question for one-ended graphs are not addressed. Constants and the interval depend on GG.

Recorded attempts

Evidence graph

Connected research record