Journal article
Sharp thresholds and percolation in the plane
- Abstract:
- Recently, 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.
- Publication status:
- Published
Actions
Access Document
- Publisher copy:
- 10.1002/rsa.20134
Authors
- Journal:
- Random Structures and Algorithms 29 (2006), 524--548. More from this journal
- Volume:
- 29
- Issue:
- 4
- Pages:
- 524-548
- Publication date:
- 2004-12-28
- DOI:
- EISSN:
-
1098-2418
- ISSN:
-
1042-9832
- Language:
-
English
- Keywords:
- Pubs id:
-
pubs:27897
- UUID:
-
uuid:8ba7d011-3e68-4ca4-982c-8cacb5090b95
- Local pid:
-
pubs:27897
- Source identifiers:
-
27897
- Deposit date:
-
2012-12-19
- ARK identifier:
Terms of use
- Copyright date:
- 2004
- Notes:
-
28 pages, 8 figures. Minor revisions and additions. To appear in
Random Structures and Algorithms
If you are the owner of this record, you can report an update to it here: Report update to this record