The diameter of KPKVB random graphs

DOI10.1017/apr.2019.23zbMath1427.05212arXiv1707.09555OpenAlexW3100225637WikidataQ127401274 ScholiaQ127401274MaRDI QIDQ5203939

Merlijn Staps, Tobias Müller

Publication date: 9 December 2019

Published in: Advances in Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

hyperbolic planerandom graphcomplex networkgraph diameter

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) Percolation (82B43) Distance in graphs (05C12)

Related Items (11)

Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting) ⋮ Sub-tree counts on hyperbolic random geometric graphs ⋮ Does a central limit theorem hold for the \(k\)-skeleton of Poisson hyperplanes in hyperbolic space? ⋮ The impact of heterogeneity and geometry on the proof complexity of random satisfiability ⋮ Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• On the largest component of a hyperbolic model of complex networks
• Geometry of surfaces
• Spectral gap of random hyperbolic graphs and related parameters
• 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
• Hyperbolic Random Graphs: Separators and Treewidth
• Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
• A Bound for the Diameter of Random Hyperbolic Graphs
• The diameter of KPKVB random graphs

This page was built for publication: The diameter of KPKVB random graphs