The Annals of Probability

Critical percolation of virtually free groups and other tree-like graphs

Iva Špakulová

Full-text: Open access

Abstract

This article presents a method for finding the critical probability pc for the Bernoulli bond percolation on graphs with the so-called tree-like structure. Such a graph can be decomposed into a tree of pieces, each of which has finitely many isomorphism classes. This class of graphs includes the Cayley graphs of amalgamated products, HNN extensions or general groups acting on trees. It also includes all transitive graphs with more than one end.

The idea of the method is to find a multi-type Galton–Watson branching process (with a parameter p) which has finite expected population size if and only if the expected percolation cluster size is finite. This provides sufficient information about pc. In particular, if the pairwise intersections of pieces are finite, then pc is the smallest positive p such that det(M−1)=0, where M is the first-moment matrix of the branching process. If the pieces of the tree-like structure are finite, then pc is an algebraic number and we give an algorithm computing pc as a root of some algebraic function.

We show that any Cayley graph of a virtually free group (i.e., a group acting on a tree with finite vertex stabilizers) with respect to any finite generating set has a tree-like structure with finite pieces. In particular, we show how to compute pc for the Cayley graph of a free group with respect to any finite generating set.

Article information

Source
Ann. Probab. Volume 37, Number 6 (2009), 2262-2296.

Dates
First available in Project Euclid: 16 November 2009

Permanent link to this document
http://projecteuclid.org/euclid.aop/1258380789

Digital Object Identifier
doi:10.1214/09-AOP458

Mathematical Reviews number (MathSciNet)
MR2573558

Zentralblatt MATH identifier
1206.60093

Subjects
Primary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43] 60D05: Geometric probability and stochastic geometry [See also 52A22, 53C65] 20P05: Probabilistic methods in group theory [See also 60Bxx]

Keywords
Bond percolation random processes on graphs virtually free groups special linear group

Citation

Špakulová, Iva. Critical percolation of virtually free groups and other tree-like graphs. Ann. Probab. 37 (2009), no. 6, 2262--2296. doi:10.1214/09-AOP458. http://projecteuclid.org/euclid.aop/1258380789.


Export citation

References

  • [1] Aizenman, M. and Barsky, D. J. (1987). Sharpness of the phase transition in percolation models. Comm. Math. Phys. 108 489–526.
  • [2] Cohen, D. E. (1989). Combinatorial Group Theory: A Topological Approach. London Mathematical Society Student Texts 14. Cambridge Univ. Press, Cambridge.
  • [3] Dunwoody, M. J. (1982). Cutting up graphs. Combinatorica 2 15–23.
  • [4] Grimmett, G. (1999). Percolation, 2nd ed. Springer, Berlin.
  • [5] Kesten, H. (1980). The critical probability of bond percolation on the square lattice equals ½. Comm. Math. Phys. 74 41–59.
  • [6] Kozáková, I. (2008). Critical percolation of free product of groups. Internat. J. Algebra Comput. 18 683–704.
  • [7] Lyons, R. and Peres, Y. (2009). Probability on trees and networks, Cambridge Univ. Press, Cambridge. To appear. Available at http://mypage.iu.edu/~rdlyons/prbtree/prbtree.html.
  • [8] Mode, C. J. (1971). Multitype Branching Processes. Theory and Applications. Modern Analytic and Computational Methods in Science and Mathematics 34. Elsevier, New York.
  • [9] Nummelin, E. (1984). General Irreducible Markov Chains and Nonnegative Operators. Cambridge Tracts in Mathematics 83. Cambridge Univ. Press, Cambridge.
  • [10] Serre, J.-P. (1980). Trees. Springer, Berlin.
  • [11] Ziff, R. M. and Scullard, C. R. (2006). Exact bond percolation thresholds in two dimensions. J. Phys. A 39 15083–15090.