No percolation at criticality on quasi-transitive graphs
For any infinite connected locally finite quasi-transitive undirected graph with , critical Bernoulli bond percolation has no infinite open cluster almost surely, i.e., , or equivalently for every vertex .
The proof in Section 10 validly combines the reduction in Section 2, Hutchcroft's Theorem 2.2, Theorem 5.1, Proposition 7.2, and Theorem 7.1, which together cover all exhaustive growth alternatives.
“Theorem 1.1. Let G be an infinite connected locally finite quasi-transitive undirected graph. If pc(G) < 1, then Ppc(G)(there is an infinite open cluster) = 0. Equivalently, Ppc(G)(|Cx| = ∞) = 0 for every vertex x.” · Show in paper