XSci

Nonuniqueness of site percolation on nonamenable quasi-transitive graphs

Yan Ru Pei

Submitted by Yan Ru Pei

Published November 22, 2026 · Version v1, November 22, 2026 · DOI 10.66977/xsci.2611.003o

Pure Mathematics

Abstract

Benjamini and Schramm conjectured in 1996 that site percolation on every nonamenable quasi-transitive graph has pc<pu. 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 l2, pc<p_{2->2}<=pu, 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 unimodular automorphism groups we adapt OpenAI's proof: cut vertices replace bridges, a pruning lemma handles retained contact vertices, a rejection step controls the junctions created by opening a vertex, and pivotal corridors become induced paths. For nonunimodular groups we extend Tran and Nguyen's site argument from vertex-transitive to quasi-transitive graphs.

View PDF