A SHORT PROOF OF THE HARRIS–KESTEN THEOREM

DOI10.1112/S002460930601842XzbMATH Open1104.60060arXivmath/0410359OpenAlexW3098656574MaRDI QIDQ5481505FDOQ5481505

Authors: Béla Bollobás, Oliver Riordan 

Publication date: 10 August 2006

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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$.

Full work available at URL: https://arxiv.org/abs/math/0410359

Recommendations

• A note on the Harris-Kesten theorem
• Percolation
• scientific article; zbMATH DE number 4066104
• Sharp thresholds and percolation in the plane
• A new lower bound for the critical probability of site percolation on the square lattice

zbMATH Keywords

bond percolationprobabilistic combinatorics

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Cited In (30)

• Analyticity Results in Bernoulli Percolation
• Three theorems in discrete random geometry
• Approximate zero-one laws and sharpness of the percolation transition in a class of models including two-dimensional Ising percolation
• Sharp threshold phenomena in statistical physics
• A short proof of Hara and Nakai’s theorem
• Lectures on the Ising and Potts models on the hypercubic lattice
• Sharp thresholds for the random-cluster and Ising models
• A short proof of a result of Katz and West
• Continuous phase transitions on Galton–Watson trees
• A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
• Renormalization of crossing probabilities in the planar random-cluster model
• Sharp thresholds and percolation in the plane
• Optimal flow through the disordered lattice
• A new computation of the critical point for the planar random-cluster model with \(q\geq1\)
• Influence and sharp-threshold theorems for monotonic measures
• A short and elementary proof of the main Bahadur-Kiefer theorem
• A Harris-Kesten theorem for confetti percolation
• Absence of site percolation at criticality in \(\mathbb{Z}^2\times\{0,1\}\)
• Percolation in high dimensions
• A note on the Harris-Kesten theorem
• Talagrand's inequality in planar Gaussian field percolation
• Crossing probabilities for planar percolation
• The critical probability for random Voronoi percolation in the plane is 1/2
• Thresholds and expectation-thresholds of monotone properties with small minterms
• Estimates of critical probabilities of percolation on finite square grids
• The critical threshold for Bargmann-Fock percolation
• A lower bound for point-to-point connection probabilities in critical percolation
• Smooth Gaussian fields and percolation
• Logarithmic variance for the height function of square-ice
• Critical point and duality in planar lattice models

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)