A short proof of the Harris-Kesten Theorem

Abstract

We give a short proof of the fundamental result that the critical probability for bond percolation in the planar square lattice is equal to 1/2. The lower bound was proved by Harris, who showed in 1960 that percolation does not occur at $p=1/2$. The other, more difficult, bound was proved by Kesten, who showed in 1980 that percolation does occur for any $p>1/2$.

17 pages, 9 figures; typos corrected. To appear in the Bulletin of the London Mathematical Society

Cited by in corpus (11)

• A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
• Rigorous confidence intervals for critical probabilities
• Percolation on self-dual polygon configurations
• Sharp thresholds for the random-cluster and Ising models
• Sharp thresholds and percolation in the plane
• Percolation on dual lattices with k-fold symmetry
• Approximate zero-one laws and sharpness of the percolation transition in a class of models including two-dimensional Ising percolation
• Optimal flow through the disordered lattice
• Logarithmic variance for the height function of square-ice
• A note on the Harris-Kesten Theorem
• Continuous phase transitions on Galton-Watson trees