RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS.

Area of Science:

• Materials Science
• Network Theory
• Computational Engineering

Background:

• Modeling macroscopic properties of composite materials from particle-scale behavior is a significant engineering challenge.
• Mechanical reinforcement in composites often relies on stiff, rod-like particles within a network structure.

Purpose of the Study:

• To develop an efficient and theoretically grounded method for modeling mechanical reinforcement in composite materials.
• To describe the transition from flexible to rigid states in disordered fiber networks using graph theory.

Main Methods:

• Utilized the graph theoretic property of rigidity to model mechanical reinforcement.
• Developed an efficient algorithmic approach named rigid graph compression (RGC).
• Adapted rigidity matroid theory to identify fundamental topological network motifs for composing rigid components.

Main Results:

• RGC requires only topological information, making it computationally efficient and stable compared to geometry-dependent methods.
• Numerical experiments showed RGC closely approximates the rigidity percolation threshold in 2D rod-hinge systems.
• The RGC approach is shown to naturally extend to higher dimensions, unlike existing 2D-specific methods.

Conclusions:

• Rigid graph compression (RGC) provides a computationally efficient and scalable method for analyzing mechanical reinforcement in composite materials.
• The topological approach of RGC offers a robust theoretical foundation applicable to complex network systems in higher dimensions.