Modeling spatial networks by contact graphs of disk packings
From MaRDI portal
Publication:6093578
DOI10.1016/j.tcs.2023.114066zbMath1520.05092MaRDI QIDQ6093578
Wei Li, Haoxin Sun, Zhong-Zhi Zhang, Mingzhe Zhu
Publication date: 7 September 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random walks and the effective resistance sum rules
- Farey graphs as models for complex networks
- An edge deletion model for complex networks
- Resistance distance and the normalized Laplacian spectrum
- The degree distribution of random \(k\)-trees
- Reverse order laws for the generalized inverses of multiple matrix products
- The electrical resistance of a graph captures its commute and cover times
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
- Combinatorial properties of Farey graphs
- The number of spanning trees in Apollonian networks
- Approximate Consensus in Stochastic Networks With Application to Load Balancing
- Robotic Surveillance and Markov Chains With Minimal Weighted Kemeny Constant
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- The small-world phenomenon
- High-dimensional Apollonian networks
- Precise determination of the fractal dimensions of Apollonian packing and space-filling bearings
- Kemeny's Constant and the Random Surfer
- The Structure and Function of Complex Networks
- Space-filling bearings
- Generalization of space-filling bearings to arbitrary loop size
- Uncovering space-independent communities in spatial networks
- Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks
- Spatial Networks
- Low-Mean Hitting Time for Random Walks on Heterogeneous Networks
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Convergence of Consensus Models With Stochastic Disturbances
- Collective dynamics of ‘small-world’ networks
- Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local Feedback
- Semi-Autonomous Consensus: Network Measures and Adaptive Trees
- Consensus and Coherence in Fractal Networks
- The Role of Kemeny's Constant in Properties of Markov Chains
- Minimizing Effective Resistance of a Graph
- Asymptotic Enumeration of Spanning Trees
This page was built for publication: Modeling spatial networks by contact graphs of disk packings
