Critical percolation on any quasi-transitive graph of exponential growth has no infinite clusters (Q309776): Difference between revisions

Quasi-transitive graphs can be thought of as natural generalisations of \(\mathbb{Z}^d\). In this paper, the author considers bond percolation in a quasi-transitive graph of exponential growth and shows that there are no infinite clusters almost surely at the critical probability. The main lemma relates the decay of the connection probability with the size of the graph distance ball.