On the largest component of subcritical random hyperbolic graphs

DOI10.1214/21-ECP380zbMath1479.05324arXiv2003.02156WikidataQ115517668 ScholiaQ115517668MaRDI QIDQ2064858

Roland Diel, Dieter Mitsche

Publication date: 6 January 2022

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.02156

zbMATH Keywords

geometric probabilityrandom hyperbolic graphs

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• Unnamed Item
• On the largest component of a hyperbolic model of complex networks
• Cliques in hyperbolic random graphs
• Spectral gap of random hyperbolic graphs and related parameters
• Geometric inhomogeneous random graphs
• Law of large numbers for the largest component in a hyperbolic model of complex networks
• Clustering in a hyperbolic model of complex networks
• Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
• The probability of connectivity in a hyperbolic model of complex networks
• Random Hyperbolic Graphs: Degree Sequence and Clustering
• Typical distances in a geometric model for complex networks
• On the Diameter of Hyperbolic Random Graphs
• Hyperbolic Random Graphs: Separators and Treewidth
• Sampling Geometric Inhomogeneous Random Graphs in Linear Time
• A Bound for the Diameter of Random Hyperbolic Graphs
• The diameter of KPKVB random graphs
• On the Second Largest Component of Random Hyperbolic Graphs
• Greedy Routing and the Algorithmic Small-World Phenomenon
• Clustering and the Hyperbolic Geometry of Complex Networks