Rigid Graph Compression: Motif-based rigidity analysis for disordered fiber networks
Samuel Heroy, Dane Taylor, Feng Shi, M. Gregory Forest, and Peter J., Mucha

TL;DR
This paper introduces Rigid Graph Compression (RGC), an efficient, topology-based algorithm for analyzing rigidity transitions in disordered fiber networks, applicable in higher dimensions than previous methods.
Contribution
The authors develop RGC, a novel topology-based method for rigidity analysis that extends beyond 2D and requires only network topology, unlike existing geometrical approaches.
Findings
RGC accurately predicts rigidity percolation thresholds in 2D systems.
RGC extends rigidity analysis to higher dimensions.
RGC is computationally efficient and stable.
Abstract
Using particle-scale models to accurately describe property enhancements and phase transitions in macroscopic behavior is a major engineering challenge in composite materials science. To address some of these challenges, we use the graph theoretic property of rigidity to model me- chanical reinforcement in composites with stiff rod-like particles. We develop an efficient algorithmic approach called rigid graph compression (RGC) to describe the transition from floppy to rigid in disordered fiber networks ('rod-hinge systems'), which form the reinforcing phase in many composite systems. To establish RGC on a firm theoretical foundation, we adapt rigidity matroid theory to identify primitive topological network motifs that serve as rules for composing interacting rigid par- ticles into larger rigid components. This approach is computationally efficient and stable, because RGC requires only…
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.
