Papers › Towards understanding structure-function relationships in random fiber networks
Towards understanding structure-function relationships in random fiber networks
Peerasait Prachaseree, Emma Lejeune
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Random fiber networks form the structural foundation of numerous biological tissues and engineered materials. From a mechanics perspective, understanding the structure-function relationships of random fiber networks is particularly interesting because when external force is applied to these networks, only a small subset of fibers will actually carry the majority of the load. Specifically, these load-bearing fibers propagate through the network to form load paths, also called force chains. However, the relationship between fiber network geometric structure, force chains, and the overall mechanical behavior of random fiber network structures remains poorly understood. To this end, we implement a finite element model of random fiber networks with geometrically exact beam elements, and use this model to explore random fiber network mechanical behavior. Our focus is twofold. First, we explore the mechanical behavior of single fiber chains and random fiber networks. Second, we propose and validate an interpretable analytical approach to predicting fiber network mechanics from structural information alone. Key findings include insight into the critical strain-stiffening transition point for single fiber chains and fiber networks generated from a Voronoi diagram, and a connection between force chains and the distance-weighted graph shortest paths that arise by treating fiber networks as spatial graph structures. This work marks an important step towards mapping the structure-function relationships of random fiber networks undergoing large deformations. Additionally, with our code distributed under open-source licenses, we hope that future researchers can directly build on our work to address related problems beyond the scope defined here.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections