Sharp thresholds and percolation in the plane

Details Sharp thresholds and percolation in the plane Sharp thresholds and percolation in the plane

2004-12-28

arxiv.org/abs/math/0412510v2

Random Structures and Algorithms 29 (2006), 524--548.

Mathematics

Probability

28 pages, 8 figures. Minor revisions and additions. To appear in Random Structures and Algorithms

Scientific paper

10.1002/rsa.20134

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.

Affiliated with

Also associated with

No associations

Rating

Sharp thresholds and percolation in the plane does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sharp thresholds and percolation in the plane, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sharp thresholds and percolation in the plane will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-118822