Uniqueness and non-uniqueness in percolation theory

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published at http://dx.doi.org/10.1214/154957806000000096 in the Probability Surveys (http://www.i-journals.org/ps/) by the In

Scientific paper

10.1214/154957806000000096

This paper is an up-to-date introduction to the problem of uniqueness versus non-uniqueness of infinite clusters for percolation on ${\mathbb{Z}}^d$ and, more generally, on transitive graphs. For iid percolation on ${\mathbb{Z}}^d$, uniqueness of the infinite cluster is a classical result, while on certain other transitive graphs uniqueness may fail. Key properties of the graphs in this context turn out to be amenability and nonamenability. The same problem is considered for certain dependent percolation models -- most prominently the Fortuin--Kasteleyn random-cluster model -- and in situations where the standard connectivity notion is replaced by entanglement or rigidity. So-called simultaneous uniqueness in couplings of percolation processes is also considered. Some of the main results are proved in detail, while for others the proofs are merely sketched, and for yet others they are omitted. Several open problems are discussed.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Uniqueness and non-uniqueness in percolation theory 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 Uniqueness and non-uniqueness in percolation theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uniqueness and non-uniqueness in percolation theory will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-383151

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.