The influence of variables on Boolean functions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Sharp thresholds and percolation in the plane
Random Structures & Algorithms
Hi-index | 0.00 |
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 in [B. Bollobas, O.M. Riordan, A short proof of the Harris-Kesten Theorem, Bull. London Math. Soc. 38 (2006) 470-484], 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 [L. Russo, An approximate zero-one law, Z. Wahrscheinlichkeitstheor. Verwandte Geb. 61 (1982) 129-139] 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.