{
  "id": "cond-mat/9807001",
  "version": "v1",
  "published": "1998-07-01T00:25:52.000Z",
  "updated": "1998-07-01T00:25:52.000Z",
  "title": "Comparison of connectivity and rigidity percolation",
  "authors": [
    "Cristian F. Moukarzel",
    "Phillip M. Duxbury"
  ],
  "comment": "11 pages, LaTeX, psfig embedded figures",
  "categories": [
    "cond-mat.stat-mech",
    "cond-mat.mtrl-sci"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1998-07-01T00:25:52.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "rigidity percolation",
      "comparison",
      "connectivity percolation",
      "constraint counting concepts",
      "exact calculations"
    ],
    "note": {
      "typesetting": "LaTeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "1998cond.mat..7001M"
    }
  }
}