Comparison of connectivity and rigidity percolation
classification
❄️ cond-mat.stat-mech
cond-mat.mtrl-sci
keywords
connectivitypercolationrigiditydilutedalgorithmsapplycalculationscomparison
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.