probability-statistics / Percolation theory on graphs and groups

The Benjamini-Schramm criticality conjecture for bond percolation on quasi-transitive graphs

Claims that for every infinite connected locally finite quasi-transitive graph with pc<1p_c<1, Bernoulli bond percolation at pcp_c has almost surely no infinite cluster. Exponential growth is Hutchcroft's theorem; the new work covers all subexponential growth, split into superpolynomial growth (a two-cluster entropy argument) and growth polynomial along a sequence of radii (a nilpotent-quotient corridor exploration). It includes θ(pc)=0\theta(p_c)=0 on Zd\mathbb Z^d for every d≥2d\ge2. The companion proves critical bond and site nonpercolation on Z3\mathbb Z^3. It does NOT settle the site form of the conjecture on general quasi-transitive graphs, and gives no critical exponents or quantitative decay.

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

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

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

The Benjamini-Schramm criticality conjecture for bond percolation on quasi-transitive graphs

Prior state unknown→proved

Claims that for every infinite connected locally finite quasi-transitive graph with pc<1p_c<1, Bernoulli bond percolation at pcp_c has almost surely no infinite cluster. Exponential growth is Hutchcroft's theorem; the new work covers all subexponential growth, split into superpolynomial growth (a two-cluster entropy argument) and growth polynomial along a sequence of radii (a nilpotent-quotient corridor exploration).…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Claims that for every infinite connected locally finite quasi-transitive graph with pc<1p_c<1, Bernoulli bond percolation at pcp_c has almost surely no infinite cluster. Exponential growth is Hutchcroft's theorem; the new work covers all subexponential growth, split into superpolynomial growth (a two-cluster entropy argument) and growth polynomial along a sequence of radii (a nilpotent-quotient corridor exploration). It includes θ(pc)=0\theta(p_c)=0 on Zd\mathbb Z^d for every d≥2d\ge2. The companion proves critical bond and site nonpercolation on Z3\mathbb Z^3. It does NOT settle the site form of the conjecture on general quasi-transitive graphs, and gives no critical exponents or quantitative decay.

Claims that for every infinite connected locally finite quasi-transitive graph with pc<1p_c<1, Bernoulli bond percolation at pcp_c has almost surely no infinite cluster. Exponential growth is Hutchcroft's theorem; the new work covers all subexponential growth, split into superpolynomial growth (a two-cluster entropy argument) and growth polynomial along a sequence of radii (a nilpotent-quotient corridor exploration). It includes θ(pc)=0\theta(p_c)=0 on Zd\mathbb Z^d for every d≥2d\ge2. The companion proves critical bond and site nonpercolation on Z3\mathbb Z^3. It does NOT settle the site form of the conjecture on general quasi-transitive graphs, and gives no critical exponents or quantitative decay.

Recorded attempts

Evidence graph

Connected research record

The Benjamini-Schramm criticality conjecture for bond percolation on quasi-transitive graphs — Mathematical Frontier Network