Sharpness of the phase transition and exponential decay of the subcritical cluster size for percolation on quasi-transitive graphs

Abstract

We study homogeneous, independent percolation on general quasi-transitive graphs. We prove that in the disorder regime where all clusters are finite almost surely, in fact the expectation of the cluster size is finite. This extends a well-known theorem by Menshikov and Aizenman & Barsky to all quasi-transitive graphs. Moreover we deduce that in this disorder regime the cluster size distribution decays exponentially, extending a result of Aizenman & Newman. Our results apply to both edge and site percolation, as well as long range (edge) percolation. The proof is based on a modification of the Aizenman & Barsky method.

Latex 2e; 25 pages (a4wide); small editorial corrections; one reference added

Cited by in corpus (8)

• A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
• Percolation on a product of two trees
• Equality of Lifshitz and van Hove exponents on amenable Cayley graphs
• Percolation on infinite graphs and isoperimetric inequalities
• Unions of random walk and percolation on infinite graphs
• Homology-changing percolation transitions on finite graphs
• Lifshitz asymptotics for percolation Hamiltonians
• Percolation with random one-dimensional reinforcements