On the Hyperbolicity of Small-World and Treelike Random Graphs

DOI10.1080/15427951.2013.828336zbMath1338.05244arXiv1201.1717OpenAlexW2061501563MaRDI QIDQ2808837

Michael W. Mahoney, Guang-Da Hu, Wenjie Fang, Wei Chen

Publication date: 25 May 2016

Published in: Internet Mathematics, Algorithms and Computation (Search for Journal in Brave)

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

zbMATH Keywords

random graphssmall-world networkscomplex networksgraph hyperbolicitydecentralized navigation

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (15)

Obstructions to a small hyperbolicity in Helly graphs ⋮ Data center interconnection networks are not hyperbolic ⋮ On Computing the Hyperbolicity of Real-World Graphs ⋮ Bounds on Gromov hyperbolicity constant ⋮ Unnamed Item ⋮ On a classical theorem on the diameter and minimum degree of a graph ⋮ Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant ⋮ On the hyperbolicity of random graphs ⋮ On the hyperbolicity constant in graph minors ⋮ Global survival of branching random walks and tree-like branching random walks ⋮ Non-Hyperbolicity of Random Graphs with Given Expected Degrees ⋮ Coexistence of competing first passage percolation on hyperbolic graphs ⋮ Gromov hyperbolicity in Mycielskian graphs ⋮ Tree decompositions and social graphs ⋮ Computing the Gromov hyperbolicity of a discrete metric space

This page was built for publication: On the Hyperbolicity of Small-World and Treelike Random Graphs