Algorithms for 3D rigidity analysis and a first order percolation transition
M.V. Chubynsky, M.F. Thorpe

TL;DR
This paper introduces approximate and exact algorithms for 3D rigidity analysis, revealing a first order percolation transition in certain networks, contrasting with previous second order findings in similar systems.
Contribution
It develops a new approximate pebble game algorithm for 3D networks and demonstrates its effectiveness in identifying a first order rigidity transition in bond-diluted 3D networks.
Findings
First order rigidity transition observed in bond-diluted 3D networks.
The pebble game algorithm is essentially exact for BCC and FCC lattices.
Transition is continuous in elastic moduli despite a first order change in cluster size.
Abstract
A fast computer algorithm, the pebble game, has been used successfully to study rigidity percolation on 2D elastic networks, as well as on a special class of 3D networks, the bond-bending 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
