Percolation on nonunimodular transitive graphs

Details Percolation on nonunimodular transitive graphs Percolation on nonunimodular transitive graphs

2007-02-28

arxiv.org/abs/math/0702875v1

Annals of Probability 2006, Vol. 34, No. 6, 2344-2364

Mathematics

Probability

Published at http://dx.doi.org/10.1214/009117906000000494 in the Annals of Probability (http://www.imstat.org/aop/) by the Ins

Scientific paper

10.1214/009117906000000494

We extend some of the fundamental results about percolation on unimodular nonamenable graphs to nonunimodular graphs. We show that they cannot have infinitely many infinite clusters at critical Bernoulli percolation. In the case of heavy clusters, this result has already been established, but it also follows from one of our results. We give a general necessary condition for nonunimodular graphs to have a phase with infinitely many heavy clusters. We present an invariant spanning tree with $p_c=1$ on some nonunimodular graph. Such trees cannot exist for nonamenable unimodular graphs. We show a new way of constructing nonunimodular graphs that have properties more peculiar than the ones previously known.

Affiliated with

Also associated with

No associations

Rating

Percolation on nonunimodular transitive graphs 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 Percolation on nonunimodular transitive graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Percolation on nonunimodular transitive graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524943