On the Diameter of Hyperbolic Random Graphs

DOI10.1007/978-3-662-47666-6_49zbMath1403.05135arXiv1512.00184OpenAlexW3102684732MaRDI QIDQ3449510

Tobias Friedrich, Anton Krohmer

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Distance in graphs (05C12)

Related Items (13)

Towards a Systematic Evaluation of Generative Network Models ⋮ On the Diameter of Hyperbolic Random Graphs ⋮ On the Diameter of Hyperbolic Random Graphs ⋮ Spectral gap of random hyperbolic graphs and related parameters ⋮ Unnamed Item ⋮ Geometric inhomogeneous random graphs ⋮ Updating Dynamic Random Hyperbolic Graphs in Sublinear Time ⋮ The diameter of KPKVB random graphs ⋮ Typical distances in a geometric model for complex networks ⋮ From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ 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
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• Diameters in preferential attachment models
• Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring
• Clustering and the Hyperbolic Geometry of Complex Networks
• Emergence of Scaling in Random Networks
• Random Hyperbolic Graphs: Degree Sequence and Clustering
• On the Diameter of Hyperbolic Random Graphs
• Generating Random Hyperbolic Graphs in Subquadratic Time
• The Diameter of a Cycle Plus a Random Matching
• Random Geometric Graphs
• The Diameter of Sparse Random Graphs
• A Bound for the Diameter of Random Hyperbolic Graphs
• Collective dynamics of ‘small-world’ networks
• The average distances in random graphs with given expected degrees
• Analyzing Kleinberg's (and other) small-world Models
• Tail bounds on hitting times of randomized search heuristics using variable drift analysis
• Concentration of Measure for the Analysis of Randomized Algorithms

This page was built for publication: On the Diameter of Hyperbolic Random Graphs