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 . The other, more difficult, bound was proved by Kesten, who showed in 1980 that percolation does occur for any .
Recommendations
Cited in
(35)- Percolation in high dimensions
- A new computation of the critical point for the planar random-cluster model with \(q\geq1\)
- Sharp threshold phenomena in statistical physics
- A short and elementary proof of the main Bahadur-Kiefer theorem
- A short proof of a result of Katz and West
- Talagrand's inequality in planar Gaussian field percolation
- Logarithmic variance for the height function of square-ice
- The critical threshold for Bargmann-Fock percolation
- Optimal flow through the disordered lattice
- A note on the Harris-Kesten theorem
- The critical probability for random Voronoi percolation in the plane is 1/2
- A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
- Absence of site percolation at criticality in \(\mathbb{Z}^2\times\{0,1\}\)
- A Harris-Kesten theorem for confetti percolation
- Lectures on the Ising and Potts models on the hypercubic lattice
- Sharp thresholds and percolation in the plane
- A short proof of Hara and Nakai’s theorem
- Three theorems in discrete random geometry
- Critical point and duality in planar lattice models
- Thresholds and expectation-thresholds of monotone properties with small minterms
- Renormalization of crossing probabilities in the planar random-cluster model
- Continuous phase transitions on Galton–Watson trees
- Crossing probabilities for planar percolation
- Analyticity Results in Bernoulli Percolation
- Smooth Gaussian fields and percolation
- Sharp thresholds for the random-cluster and Ising models
- Estimates of critical probabilities of percolation on finite square grids
- An introduction to Russo-Seymour-Welsh theory
- The Maker-Breaker percolation game on the square lattice
- Homological percolation on a torus: plaquettes and permutohedra
- The Maker-Breaker percolation game on a random board
- On the continuity of enhancement percolation
- A lower bound for point-to-point connection probabilities in critical percolation
- Influence and sharp-threshold theorems for monotonic measures
- Approximate zero-one laws and sharpness of the percolation transition in a class of models including two-dimensional Ising percolation
This page was built for publication: A SHORT PROOF OF THE HARRIS–KESTEN THEOREM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5481505)
