An algorithm for two-dimensional rigidity percolation: The pebble game (Q1375495): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcph.1997.5809 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2121403868 / rank | |||
Revision as of 15:49, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for two-dimensional rigidity percolation: The pebble game |
scientific article |
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
