Sharp thresholds and percolation in the plane

Simple item page
dc.creatorBollobas, Bela
dc.creatorRiordan, Oliver
dc.date2004-12-28
dc.date2005-10-04
dc.date.accessioned2026-07-07T07:44:21Z
dc.date.available2026-07-07T07:44:21Z
dc.descriptionRecently, the authors showed that the critical probability for random Voronoi percolation in the plane is 1/2. A by-product of the method was a short proof of the Harris-Kesten Theorem concerning bond percolation in the planar square lattice. The aim of this paper is to show that the same techniques can be applied to many other planar percolation models, both to obtain short proofs of known results, and to prove new ones.
dc.description28 pages, 8 figures. Minor revisions and additions. To appear in Random Structures and Algorithms
dc.identifierhttps://arxiv.org/abs/math/0412510
dc.identifierhttp://arxiv.org/abs/math/0412510
dc.identifierRandom Structures and Algorithms 29 (2006), 524--548.
dc.identifierdoi:10.1002/rsa.20134
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123166
dc.subjectProbability
dc.subjectCombinatorics
dc.subject60K35; 82B43
dc.titleSharp thresholds and percolation in the plane
dc.typetext

Files

Collections

arXiv