A note on the Harris-Kesten theorem

DOI10.1016/J.EJC.2006.05.022MaRDI QIDQ2372432zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Oliver Riordan

Publication date 27 July 2007

Published in European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Abstract: Recently, a short proof of the Harris-Kesten result that the critical probability for bond percolation in the planar square lattice is 1/2 was given, using a sharp threshold result of Friedgut and Kalai. Here we point out that a key part of this proof may be replaced by an argument of Russo from 1982, using his approximate zero-one law in place of the Friedgut-Kalai result. Russo's paper gave a new proof of the Harris-Kesten Theorem that seems to have received little attention.

Recommendations

• A SHORT PROOF OF THE HARRIS–KESTEN THEOREM
• A new lower bound for the critical probability of site percolation on the square lattice
• Percolation
• Sharp thresholds and percolation in the plane
• Percolation in high dimensions

Cites work

• A SHORT PROOF OF THE HARRIS–KESTEN THEOREM
• An approximate zero-one law
• Every monotone graph property has a sharp threshold
• scientific article; zbMATH DE number 3198427 (Why is no real title available?)
• The critical probability of bond percolation on the square lattice equals 1/2

Cited in

(6)

• Around two theorems and a lemma by Lucio Russo
• scientific article; zbMATH DE number 417286 (Why is no real title available?)
• A SHORT PROOF OF THE HARRIS–KESTEN THEOREM
• Crossing probabilities for planar percolation
• The Maker-Breaker percolation game on the square lattice
• The Maker-Breaker percolation game on a random board

This page was built for publication: A note on the Harris-Kesten theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372432)