Random-Graph Models and Characterization of Granular Networks
arXiv:1907.13424 · doi:10.1093/comnet/cnz037
Abstract
Various approaches and measures from network analysis have been applied to granular and particulate networks to gain insights into their structural, transport, failure-propagation and other systems-level properties. In this article, we examine a variety of common network measures and study their ability to characterize various two-dimensional and three-dimensional spatial random-graph models and empirical two-dimensional granular networks. We identify network measures that are able to distinguish between physically plausible and unphysical spatial network models. Our results also suggest that there are significant differences in the distributions of certain network measures in two and three dimensions, hinting at important differences that we also expect to arise in experimental granular networks.
arXiv comment23 pages, 14 figures, 2 tables
References in corpus (19)
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- Efficient Behavior of Small-World Networks
- Mixing patterns in networks
- Community detection in networks: A user guide
- Subgraph Centrality in Complex Networks
- Communicability in complex networks
- Network Analysis of Particles and Grains
- Extraction of Force-Chain Network Architecture in Granular Materials Using Community Detection
- The Influence of Network Topology on Sound Propagation in Granular Materials
- Sound propagation and force chains in granular materials
- Random geometric graphs with general connection functions
- Jamming and Stress Propagation in Granular Materials
- Nonlinear Coherent Structures in Granular Crystals
- Forecasting failure locations in two-dimensional disordered lattices
- Random Rectangular Graphs
- Impact of boundaries on fully connected random geometric networks
- Controlling fracture cascades through twisting and quenching
- More is less: Connectivity in fractal regions
Cited by in corpus (7)
- Spatial Applications of Topological Data Analysis: Cities, Snowflakes, Random Structures, and Spiders Spinning Under the Influence
- Classical and quantum random-walk centrality measures in multilayer networks
- A Random-Line-Graph Approach to Overlapping Line Segments
- Spatial Strength Centrality and the Effect of Spatial Embeddings on Network Architecture
- Dynamical processes on metric networks
- Ensemble inequivalence and phase transitions in unlabeled networks
- The Roles of Size, Packing, and Cohesion in the Emergence of Force Chains in Granular Packings