An algorithm for two-dimensional rigidity percolation: The pebble game (Q1375495)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1100740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for two-dimensional rigidity percolation: The pebble game |
scientific article; zbMATH DE number 1100740 |
Statements
An algorithm for two-dimensional rigidity percolation: The pebble game (English)
0 references
28 January 1998
0 references
In the context of generic rigidity percolation, we show how to calculate the number of internal degrees of freedom, identify all rigid clusters, and locate the overconstrained regions. For a network of \(n\) sites the pebble game has a worst case performance of \(O(n^2)\). In our applications its performance scaled as \(n^{1.15}\) at the rigidity transition, while away from the transition region it grew linearly.
0 references
graph rigidity
0 references
graph algorithm
0 references
vector percolation
0 references
floppy modes
0 references
network glass
0 references
number of internal degrees of freedom
0 references
rigid clusters
0 references
overconstrained regions
0 references
0.8054232001304626
0 references
0.8051020503044128
0 references
0.7700847387313843
0 references
0.7305970191955566
0 references
0.7293874025344849
0 references
