Lack of Gromov-hyperbolicity in colored random networks

zbMATH Open1230.05264MaRDI QIDQ3173678FDOQ3173678

Authors: Yilun Shang 

Publication date: 10 October 2011

Recommendations

• Non-hyperbolicity of random graphs with given expected degrees
• Lack of Gromov-hyperbolicity in small-world networks
• Lack of hyperbolicity in asymptotic Erdős-Renyi sparse random graphs
• On the hyperbolicity of small-world and treelike random graphs
• On the hyperbolicity of random graphs

zbMATH Keywords

random graphcomplex networkhyperbolicity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12)

Cited In (16)

• The hyperbolicity constant of infinite circulant graphs
• Gromov hyperbolicity of Johnson and Kneser graphs
• On the hyperbolicity constant in graph minors
• Hyperbolicity on graph operators
• Title not available (Why is that?)
• Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant
• Gromov hyperbolicity in the Cartesian sum of graphs
• On a classical theorem on the diameter and minimum degree of a graph
• On the hyperbolicity constant of circular-arc graphs
• Geometric and topological properties of the complementary prism networks
• Cheeger isoperimetric constant of Gromov hyperbolic manifolds and graphs
• Recent Results on Hyperbolicity on Unitary Operators on Graphs
• Parabolicity on graphs
• Lack of Gromov-hyperbolicity in small-world networks
• A note on isoperimetric inequalities of Gromov hyperbolic manifolds and graphs
• On computing the Gromov hyperbolicity

This page was built for publication: Lack of Gromov-hyperbolicity in colored random networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173678)