We summarize ideas and methods that apply to rigidity and connectivity percolation. These include: constraint counting concepts, exact calculations on diluted trees and numerical results on diluted lattices using matching algorithms. The similarities and differences between connectivity and rigidity percolation are discussed.
CITATION STYLE
Moukarzel, C. F., & Duxbury, P. M. (2005). Comparison of Connectivity and Rigidity Percolation. In Rigidity Theory and Applications (pp. 69–79). Kluwer Academic Publishers. https://doi.org/10.1007/0-306-47089-6_5
Mendeley helps you to discover research relevant for your work.