Rigid Graph Compression: Motif-Based Rigidity Analysis for Disordered Fiber Networks

DOI10.1137/17M1157271zbMath1401.60178arXiv1711.05790OpenAlexW3105129604WikidataQ93201567 ScholiaQ93201567MaRDI QIDQ4689152

M. Gregory Forest, Samuel Heroy, Dane Taylor, Peter J. Mucha, F. Bill Shi

Publication date: 15 October 2018

Published in: Multiscale Modeling & Simulation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.05790

zbMATH Keywords

rigiditycomposite materialsgraph compressionnetwork motifsfiber networkspebble gamerigidity matroid theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15) Spatial models in sociology (91D25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Rigidity Percolation in Disordered 3D Rod Systems

Uses Software

• NetworkX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for two-dimensional rigidity percolation: The pebble game
• On graphs and rigidity of plane skeletal structures
• Eigenvector synchronization, graph rigidity and the molecule problem
• Rigidity Matroids
• Conditions for Unique Graph Realizations
• Network-Based Assessments of Percolation-Induced Current Distributions in Sheared Rod Macromolecular Dispersions
• Percolation-Induced Exponential Scaling in the Large Current Tails of Random Resistor Networks

This page was built for publication: Rigid Graph Compression: Motif-Based Rigidity Analysis for Disordered Fiber Networks