Percolation on nonunimodular transitive graphs

• Ádám Timár ^[1]
  1. [1] Indiana University
• Localización: Annals of probability: An official journal of the Institute of Mathematical Statistics, ISSN 0091-1798, Vol. 34, Nº. 6, 2006, págs. 2344-2364
• Idioma: inglés
• DOI: 10.1214/009117906000000494
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.