Non-Hyperbolicity of Random Graphs with Given Expected Degrees
From MaRDI portal
Publication:5745542
DOI10.1080/15326349.2013.838510zbMath1280.05125MaRDI QIDQ5745542
Publication date: 30 January 2014
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326349.2013.838510
91D30: Social networks; opinion dynamics
05C82: Small world graphs, complex networks (graph-theoretic aspects)
05C80: Random graphs (graph-theoretic aspects)
60C05: Combinatorial probability
05C07: Vertex degrees
Related Items
Cites Work
- Non-hyperbolicity in random regular graphs and their traffic characteristics
- Lack of Gromov-hyperbolicity in small-world networks
- Gauge theory correlators from non-critical string theory
- Generating simple random graphs with prescribed degree distribution
- The large-\(N\) limit of superconformal field theories and supergravity
- On the Hyperbolicity of Small-World and Treelike Random Graphs
- Large dicliques in a directed inhomogeneous random graph
- Statistical mechanics of complex networks
- Easy problems for tree-decomposable graphs
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- Power-Law Distributions in Empirical Data
- The phase transition in inhomogeneous random graphs
- On the hyperbolicity of chordal graphs