The Annals of Applied Probability

Existence and uniqueness of infinite components in generic rigidity percolation

Alexander E. Holroyd

Full-text: Open access


We consider a percolation configuration on a general lattice in which edges are included independently with probability p. We study the rigidity properties of the resulting configuration, in the sense of generic rigidity in d dimensions. We give a mathematically rigorous treatment of the problem, starting with a definition of an infinite rigid component. We prove that, for a broad class of lattices, there exists an infinite rigid component for some p strictly below unity. For the particular case of two-dimensional rigidity on the two-dimensional triangular lattice, we prove first that the critical probability for rigidity percolation lies strictly above that for connectivity percolation and second that the infinite rigid component (when it exists) is unique for all but countably many values of p. We conjecture that this uniqueness in fact holds for all p. Some of our arguments could be applied to two-dimensional lattices in more generality.

Article information

Ann. Appl. Probab., Volume 8, Number 3 (1998), 944-973.

First available in Project Euclid: 9 August 2002

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60K35: Interacting random processes; statistical mechanics type models; percolation theory [See also 82B43, 82C43]
Secondary: 82B43: Percolation [See also 60K35] 05C10: Planar graphs; geometric and topological aspects of graph theory [See also 57M15, 57M25]

Rigidity percolation graph rigidity percolation enhancements critical points infinite components uniqueness


Holroyd, Alexander E. Existence and uniqueness of infinite components in generic rigidity percolation. Ann. Appl. Probab. 8 (1998), no. 3, 944--973. doi:10.1214/aoap/1028903458.

Export citation


  • [1] Aizenman, M. and Grimmett, G. (1991). Strict monotonicity for critical points in percolation and ferromagnetic models. J. Statist. Phy s. 63 817-835.
  • [2] Burton, R. M. and Keane, M. (1989). Density and uniqueness in percolation. Comm. Math. Phy s. 121 501-505.
  • [3] Gluck, H. (1974). Almost all simply connected closed surfaces are rigid. Lecture Notes in Math. 438 225-239. Springer, Berlin.
  • [4] Graver, J., Servatius, B. and Servatius, H. (1993). Combinatorial Rigidity. Amer. Math. Soc. Providence, RI.
  • [5] Grimmett, G. R. (1989). Percolation. Springer, New York.
  • [6] Grimmett, G. R. (1997). Percolation and disordered sy stems. Ecole d'Et´e de Probabilit´es de Saint Flour XXVI, 1996. Lecture Notes in Math. 1665 153-300. Springer, Berlin.
  • [7] Hendrickson, B. (1992). Conditions for unique graph realisations. SIAM J. Comput. 21 65-84.
  • [8] Jacobs, D. J. and Thorpe, M. F. (1996). Generic rigidity percolation in two dimensions. Phy s. Rev. E 53 3682-3693.
  • [9] Laman, G. (1970). On graphs and rigidity of plane skeletal structures. J. Engrg. Math. 4 331-440.
  • [10] Liggett, T. M., Schonmann, R. H. and Stacey, A. M. (1997). Domination by product measures. Ann. Probab. 25 71-95.