Critical percolation on certain non-unimodular graphs

Details Critical percolation on certain non-unimodular graphs Critical percolation on certain non-unimodular graphs

2005-01-29

arxiv.org/abs/math/0501532v3

New York J. of Math., 12 (2006), 1-18.

Mathematics

Probability

15 pages, 5 figures. Several corrections to previous version

Scientific paper

An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the amenable cases Z^2 and Z^d for large d, as well as for all non-amenable graphs with unimodular automorphism groups. We show that the conjecture holds for the basic classes of non-amenable graphs with non-unimodular automorphism groups: for decorated trees and the non-unimodular Diestel-Leader graphs. We also show that the connection probability between two vertices decay exponentially in their distance. Finally, we prove that critical percolation on the positive part of the lamplighter group has no infinite clusters.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-392127