Cheeger constant and the percolation nonuniqueness phase
Let be an infinite, connected, locally finite, vertex-transitive graph. In Bernoulli bond percolation with parameter , each edge is retained independently with probability ; write for the number of infinite connected components of the retained subgraph and for its law. Define the critical and uniqueness thresholds by
For a nonempty finite vertex set , let be the set of edges with exactly one endpoint in , and define the (normalized) Cheeger constant by
The question is whether, for every such ,
Percolation on Hyperbolic Graphs Percolation at the uniqueness threshold via subgroup relativization
Background
The equivalence is the vertex-transitive case of the Benjamini–Schramm conjecture, formulated in 1996 for connected, locally finite, quasi-transitive graphs. Here quasi-transitive means that the automorphism group has finitely many vertex orbits; vertex-transitive graphs are a special case. The conjecture connects a geometric isoperimetric condition—positive Cheeger constant, or nonamenability—to the existence of a parameter interval with infinitely many infinite clusters. On amenable graphs, the Burton–Keane uniqueness argument rules out that interval; Gandolfi, Keane, and Newman extended the argument to amenable quasi-transitive graphs. Percolation on Hyperbolic Graphs Non-uniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
The first transitive examples with came from Grimmett and Newman’s work on products of regular trees with Euclidean lattices: they established separation when the tree degree is sufficiently large. This helped motivate the broader conjecture, but such perturbative examples do not settle the general implication from nonamenability. Subsequent work has combined geometric, combinatorial, and probabilistic methods to prove separation for broader, but still restricted, classes. Non-uniqueness and mean-field criticality for percolation on nonunimodular transitive graphs
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 1
Claimed by OpenAI. For every infinite connected locally finite nonamenable quasi-transitive graph, the manuscript claims p_c<p_{2->2}<=p_u for Bernoulli bond percolation, yielding an interval with infinitely many infinite clusters. On vertex-transitive graphs this addresses the positive-Cheeger-constant implication in the page’s equivalence. The converse implication and graphs outside the stated locally finite setting are not established by this claim.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-214-01-Nonuniqueness-of-percolation-on-nonamenable-quasi-transitive-graphs.pdfOpen