Algorithms for three-dimensional rigidity analysis and a first-order percolation transition
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
A fast computer algorithm, the pebble game, has been used successfully to analyze the rigidity of two-dimensional (2D) elastic networks, as well as of a special class of 3D networks, the bond-bending networks, and enabled significant progress in studies of rigidity percolation on such networks. Application of the pebble game approach to general 3D networks has been hindered by the fact that the underlying mathematical theory is, strictly speaking, invalid in this case. We construct an approximate pebble game algorithm for general 3D networks, as well as a slower but exact algorithm, the relaxation algorithm, that we use for testing the new pebble game. Based on the results of these tests and additional considerations, we argue that in the particular case of randomly diluted central-force networks on bcc and fcc lattices, the pebble game is essentially exact. Using the pebble game, we observe an extremely sharp jump in the largest rigid cluster size in bond-diluted central-force networks in 3D, with the percolating cluster appearing and taking up most of the network after a single bond addition. This strongly suggests a first-order rigidity percolation transition, which is in contrast to the second-order transitions found previously for the 2D central-force and 3D bond-bending networks. While a first order rigidity transition has been observed previously for Bethe lattices and networks with "chemical order," here it is in a regular randomly diluted network. In the case of site dilution, the transition is also first order for bcc lattices, but results for fcc lattices suggest a second-order transition. Even in bond-diluted lattices, while the transition appears massively first order in the order parameter (the percolating cluster size), it is continuous in the elastic moduli. This, and the apparent nonuniversality, make this phase transition highly unusual.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it