Random Hyperbolic Graphs: Degree Sequence and Clustering
From MaRDI portal
Publication:3167045
DOI10.1007/978-3-642-31585-5_51zbMath1369.68270arXiv1205.1470OpenAlexW2963982460MaRDI QIDQ3167045
Luca Gugelmann, Ueli Peter, Konstantinos D. Panagiotou
Publication date: 1 November 2012
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.1470
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (34)
Towards a Systematic Evaluation of Generative Network Models ⋮ Not all interventions are equal for the height of the second peak ⋮ On the Diameter of Hyperbolic Random Graphs ⋮ On the Diameter of Hyperbolic Random Graphs ⋮ Sub-tree counts on hyperbolic random geometric graphs ⋮ Scale-free network clustering in hyperbolic and other random graphs ⋮ Spectral gap of random hyperbolic graphs and related parameters ⋮ Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry ⋮ Enumeration of graphs with a heavy-tailed degree sequence ⋮ Bootstrap percolation and the geometry of complex networks ⋮ Scale-free percolation mixing time ⋮ Unnamed Item ⋮ Solving vertex cover in polynomial time on hyperbolic random graphs ⋮ Geometric inhomogeneous random graphs ⋮ Updating Dynamic Random Hyperbolic Graphs in Sublinear Time ⋮ Law of large numbers for the largest component in a hyperbolic model of complex networks ⋮ Clustering and the Hyperbolic Geometry of Complex Networks ⋮ Cliques in hyperbolic random graphs ⋮ 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 ⋮ Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ⋮ Scale-free percolation in continuous space: quenched degree and clustering coefficient ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ The probability of connectivity in a hyperbolic model of complex networks ⋮ Typical distances in a geometric model for complex networks ⋮ From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) ⋮ On the largest component of subcritical random hyperbolic graphs ⋮ Degree correlations in scale-free random graph models ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Penalising transmission to hubs in scale-free spatial random graphs ⋮ On the Second Largest Component of Random Hyperbolic Graphs ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time
This page was built for publication: Random Hyperbolic Graphs: Degree Sequence and Clustering