Modeling spatial networks by contact graphs of disk packings
From MaRDI portal
Recommendations
- Enumeration of spanning trees on contact graphs of disk packings
- Spatial Gibbs random graphs
- Spatial networks. A complete introduction: from graph theory and statistical physics to real-world applications
- Spatial preferential attachment networks: power laws and clustering coefficients
- TOPOLOGICAL ANALYSIS OF SPECIFIC SPATIAL COMPLEX NETWORKS
Cites work
- An edge deletion model for complex networks
- Approximate Consensus in Stochastic Networks With Application to Load Balancing
- Asymptotic Enumeration of Spanning Trees
- Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks
- Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local Feedback
- Collective dynamics of `small-world' networks
- Combinatorial properties of Farey graphs
- Consensus and Coherence in Fractal Networks
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Convergence of Consensus Models With Stochastic Disturbances
- Degree resistance distance of unicyclic graphs
- Emergence of Scaling in Random Networks
- Farey graphs as models for complex networks
- Generalization of space-filling bearings to arbitrary loop size
- High-dimensional Apollonian networks
- scientific article; zbMATH DE number 5784227 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 3061533 (Why is no real title available?)
- Kemeny's Constant and the Random Surfer
- Kirchhoff index as a measure of edge centrality in weighted networks: nearly linear time algorithms
- Low-Mean Hitting Time for Random Walks on Heterogeneous Networks
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs
- Minimizing Effective Resistance of a Graph
- Precise determination of the fractal dimensions of Apollonian packing and space-filling bearings
- Random walks and the effective resistance sum rules
- Resistance distance and the normalized Laplacian spectrum
- Reverse order laws for the generalized inverses of multiple matrix products
- Robotic Surveillance and Markov Chains With Minimal Weighted Kemeny Constant
- Semi-Autonomous Consensus: Network Measures and Adaptive Trees
- Space-filling bearings
- Spatial networks. A complete introduction: from graph theory and statistical physics to real-world applications
- Statistical mechanics of complex networks
- The degree distribution of random \(k\)-trees
- The electrical resistance of a graph captures its commute and cover times
- The number of spanning trees in Apollonian networks
- The role of Kemeny's constant in properties of Markov chains
- The small-world phenomenon: an algorithmic perspective
- The Structure and Function of Complex Networks
- Uncovering space-independent communities in spatial networks
Cited in
(2)
This page was built for publication: Modeling spatial networks by contact graphs of disk packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6093578)