On the Second Largest Component of Random Hyperbolic Graphs

DOI10.1137/18M121201XzbMath1427.05211arXiv1712.02828OpenAlexW2772497464WikidataQ126769439 ScholiaQ126769439MaRDI QIDQ5244122

Dieter Mitsche, Marcos A. Kiwi

Publication date: 20 November 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

scale-free networkscomponent structurerandom hyperbolic graphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items

Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions ⋮ Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting) ⋮ Assortativity and bidegree distributions on Bernoulli random graph superpositions ⋮ Sub-tree counts on hyperbolic random geometric graphs ⋮ Clustering and percolation on superpositions of Bernoulli 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 ⋮ On the largest component of subcritical random hyperbolic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Scale-free percolation
• On the largest component of a hyperbolic model of complex networks
• Bootstrap percolation and the geometry of complex networks
• 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
• 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
• Bootstrap percolation on geometric inhomogeneous random graphs
• On a geometrization of the Chung–Lu model for complex networks
• A Bound for the Diameter of Random Hyperbolic Graphs
• Greedy Routing and the Algorithmic Small-World Phenomenon