Skip to content
All apps

Many infinite clusters: percolation in hyperbolic space (3D)

About this app

A dome of heptagons, the {7,3} lattice of the hyperbolic plane: every edge is open with probability p. Between p_c and p_u several separate clusters reach the rim at once; on ℤ² it jumps straight from none to one. Dome, Poincaré disc and ℤ² comparison, counter and curve over p. Benjamini–Schramm 1996, proved for every nonamenable graph in openai/math, family 214 (formalised in Lean). Exhibit-ready.

What it is about

In percolation each edge of a lattice is open with probability p. Above the threshold p_c there are infinite clusters, and above p_u only one. On the square lattice ℤ² the two thresholds coincide: it jumps straight from none to one infinite cluster. In 1996 Benjamini and Schramm conjectured that on every non-amenable graph with finitely many vertex types p_c < p_u, so that infinitely many infinite clusters coexist in between. They proved this for planar hyperbolic lattices such as {7,3} in 2001. An AI-generated preprint in github.com/openai/math (family 214) claims a proof in general; the catalogue lists it as formalised in Lean, and it is not peer-reviewed.

What the app shows

A finite piece of the {7,3} lattice, where three heptagons meet at every vertex, appears as a dome (hemisphere model) or as a Poincaré disc. A piece of ℤ² sits alongside for comparison. Open edges link up into clusters; “infinite” here means a cluster reaches from the inner circle to the edge. A counter and a curve over p show how many such clusters there are. The zone boundaries p_c ≈ 0.53 and p_u ≈ 0.80 are rough values from simulating this piece.

Try it yourself

Raise p slowly: below p_c no cluster reaches the edge. Between the thresholds several separate clusters reach the edge at the same time. Above p_u they merge into one. Set the same value in the ℤ² comparison and notice that there is no intermediate phase there. The sculpture only illustrates; the proof applies to every non-amenable graph, including ones that cannot be drawn. The app can run as an exhibit.

Frequently asked questions

What is a non-amenable graph?
A graph is non-amenable if every finite set of vertices has a boundary at least proportional to its size. Intuitively the graph grows exponentially, like a tree or a hyperbolic lattice. Lattices like ℤ², by contrast, are amenable, because large squares have a small boundary relative to their area.
What do p_c and p_u mean in percolation?
p_c is the critical probability above which infinite clusters appear. p_u is the threshold above which there is exactly one infinite cluster. On ℤ^d the two coincide; on hyperbolic lattices there is a phase in between with infinitely many infinite clusters.
Has the Benjamini–Schramm conjecture p_c < p_u been proved?
Benjamini and Schramm proved it for planar hyperbolic lattices in 2001; in general it was open for a long time. An AI-generated preprint in the catalogue github.com/openai/math (family 214) claims a proof of p_c < p_u for bond percolation on every non-amenable graph with finitely many vertex types. The catalogue lists this as formalised in Lean; the preprint has not yet been peer-reviewed.
What can I try out in this app?
You set p and see on a dome of heptagons or a Poincaré disc which clusters reach the edge. A counter and a curve over p show the three phases. A ℤ² comparison shows that the intermediate phase is missing there.

Subject: Open problems, solved by AI

More from Open problems, solved by AI

A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps