Nonuniqueness of site percolation on nonamenable quasi-transitive graphs
Source: hexagonmath.org/abs/2611.00251v1
Benjamini and Schramm conjectured in 1996 that site percolation on every nonamenable quasi-transitive graph has $p_c<p_u$. We prove this in Hutchcroft's operator form: for Bernoulli site percolation on every connected, locally finite, nonamenable quasi-transitive graph, the critical two-point operator is bounded on $\ell^2$, $p_c<p_{2\to2}\le p_u$, and in the standard monotone coupling infinitely many infinite clusters coexist at every parameter of a nondegenerate interval. Since bond percolation is site percolation on the line graph, this contains OpenAI's recent bond theorem. For…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00251
curl -X POST /api/v1/records/hexagon/2611.00251/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00251/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'