## The Annals of Probability

### Percolation on nonunimodular transitive graphs

Ádám Timár

#### Abstract

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 pc=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.

#### Article information

Source
Ann. Probab., Volume 34, Number 6 (2006), 2344-2364.

Dates
First available in Project Euclid: 13 February 2007

https://projecteuclid.org/euclid.aop/1171377446

Digital Object Identifier
doi:10.1214/009117906000000494

Mathematical Reviews number (MathSciNet)
MR2294985

Zentralblatt MATH identifier
1114.60083

#### Citation

Timár, Ádám. Percolation on nonunimodular transitive graphs. Ann. Probab. 34 (2006), no. 6, 2344--2364. doi:10.1214/009117906000000494. https://projecteuclid.org/euclid.aop/1171377446

#### References

• Benjamini, I., Lyons, R., Peres, Y. and Schramm, O. (1999). Group-invariant percolation on graphs. Geom. Funct. Anal. 9 29–66.
• Benjamini, I., Lyons, R., Peres, Y. and Schramm, O. (1999). Critical percolation on any nonamenable group has no infinite clusters. Ann. Probab. 27 1347–1356.
• Burton, R. M. and Keane, M. (1989). Density and uniqueness in percolation. Comm. Math. Phys. 121 501–505.
• Diestel, R. and Leader, I. (2001). A conjecture concerning a limit of non-Cayley graphs. J. Algebraic Combin. 14 17–25.
• Gandolfi, A., Keane, M. S. and Newman, C. M. (1992). Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses. Probab. Theory Related Fields 92 511–527.
• Häggstr öm, O. (1997). Infinite clusters in dependent automorphism invariant percolation on trees. Ann. Probab. 25 1423–1436.
• Häggström, O., Peres, Y. and Schonmann, R. (1999). Percolation on transitive graphs as a coalescent process: Relentless merging followed by simultaneous uniqueness. In Perplexing Probability Problems: Festschrift in Honor of Harry Kesten (M. Bramson and R. Durrett, eds.) 69–90. Birkhäuser, Boston.
• Hara, T. and Slade, G. (1995). The self-avoiding walk and percolation critical points in high dimensions. Combin. Probab. Comput. 4 197–215.
• Harris, T. E. (1960). A lower bound on the critical probability in a certain percolation process. Proc. Cambridge Phil. Soc. 56 13–20.
• Kesten, H. (1980). The critical probability of bond percolation on the square lattice equals $1\over2$. Comm. Math. Phys. 74 41–59.
• Lyons, R. (2000). Phase transitions on nonamenable graphs. J. Math. Phys. 41 1099–1126.
• Lyons, R. and Peres, Y. (2006). Probability on Trees and Networks. To appear. Available at http://mypage.iu.edu/~rdlyons/prbtree/prbtree.html.
• Pak, I. and Smirnova-Nagnibeda, T. (2000). On uniqueness of percolation on nonamenable Cayley graphs. C. R. Acad. Sci. Paris Ser. I Math. 330 495–500.
• Peres, Y., Pete, G. and Scolnicov, A. (2006). Critical percolation on certain non-unimodular graphs. New York J. Math. 12 1–18.
• Schonmann, R. (2001). Multiplicity of phase transitions and mean-field criticality on highly non-amenable graphs. Comm. Math. Phys. 219 271–322.
• Soardi, P. M. and Woess, W. (1990). Amenability, unimodularity, and the spectral radius of random walks on infinite graphs. Math. Z. 205 471–486.
• Timár, Á. (2006). Neighboring clusters in Bernoulli percolation. Ann. Probab. 34 2332–2343.
• Trofimov, V. I. (1985). Groups of automorphisms of graphs as topological groups. Mat. Zametki 38 378–385. [English translation Math. Notes 38 (1985) 717–720.]
• Woess, W. (2005). Lamplighters, Diestel–Leader graphs, random walks, and harmonic functions. Combin. Probab. Comput. 14 415–433.