Typical distances in a geometric model for complex networks
From MaRDI portal
Publication:3389693
DOI10.24166/im.13.2017zbMath1491.05163arXiv1506.07811OpenAlexW2963822936MaRDI QIDQ3389693
Michel Bode, Nikolaos Fountoulakis, Mohammed Amin Abdullah
Publication date: 23 March 2022
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.07811
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12)
Related Items (12)
Sub-tree counts on hyperbolic random geometric graphs ⋮ Spectral gap of random hyperbolic graphs and related parameters ⋮ Geometric inhomogeneous random graphs ⋮ The diameter of KPKVB random graphs ⋮ The contact process on random hyperbolic graphs: metastability and critical exponents ⋮ Limit theory for isolated and extreme points in hyperbolic random geometric graphs ⋮ Clustering in a hyperbolic model of complex networks ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ On the largest component of subcritical random hyperbolic graphs ⋮ Penalising transmission to hubs in scale-free spatial random graphs ⋮ On the Second Largest Component of Random Hyperbolic Graphs ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the largest component of a hyperbolic model of complex networks
- Diameters in preferential attachment models
- Metric structure of random networks
- Connected components in random graphs with given expected degree sequences
- The diameter of a scale-free random graph
- The degree sequence of a scale-free random graph process
- Random Graphs and Complex Networks
- Typical Distances in Ultrasmall Random Networks
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Random Hyperbolic Graphs: Degree Sequence and Clustering
- On the Diameter of Hyperbolic Random Graphs
- Lectures on Complex Networks
- Universality for distances in power-law random graphs
- On a geometrization of the Chung–Lu model for complex networks
- Paths in graphs
- A Bound for the Diameter of Random Hyperbolic Graphs
- The phase transition in inhomogeneous random graphs
- The average distances in random graphs with given expected degrees
- On Palm probabilities
This page was built for publication: Typical distances in a geometric model for complex networks