Clustering and the Hyperbolic Geometry of Complex Networks

DOI10.1007/978-3-319-13123-8_1zbMath1342.05155arXiv1309.0459OpenAlexW2132221552MaRDI QIDQ2945267

Nikolaos Fountoulakis, Elisabetta Candellero

Publication date: 9 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

hyperbolic geometryglobal clustering coefficient of random graphs on the hyperbolic plane

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items (8)

On the Diameter of Hyperbolic Random Graphs ⋮ Spectral gap of random hyperbolic graphs and related parameters ⋮ Geometric inhomogeneous random graphs ⋮ Cliques in hyperbolic random 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 ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time

This page was built for publication: Clustering and the Hyperbolic Geometry of Complex Networks