# Hyperbolic Geometry of Complex Networks

@article{Krioukov2010HyperbolicGO,
title={Hyperbolic Geometry of Complex Networks},
author={Dmitri V. Krioukov and Fragkiskos Papadopoulos and Maksim Kitsak and Amin Vahdat and Mari{\'a}n Bogu{\~n}{\'a}},
journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
year={2010},
volume={82 3 Pt 2},
pages={
036106
}
}
• Published 26 June 2010
• Computer Science, Mathematics
• Physical review. E, Statistical, nonlinear, and soft matter physics
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong clustering in complex networks emerge naturally as simple reflections of the negative curvature and metric property of the underlying hyperbolic geometry. Conversely, we show that if a network has some metric structure, and if the network degree distribution is…
755 Citations

## Figures and Tables from this paper

Emergent Complex Network Geometry
• Computer Science, Mathematics
Scientific reports
• 2015
It is shown that a single two parameter network model, the growing geometrical network, can generate complex network geometries with non-trivial distribution of curvatures, combining exponential growth and small-world properties with finite spectral dimensionality.
Clustering and the Hyperbolic Geometry of Complex Networks
• Computer Science, Mathematics
Internet Math.
• 2016
This article considers the global clustering coefficient of random graphs on the hyperbolic plane, proposed recently by Krioukov and colleagues as a mathematical model of complex networks, under the fundamental assumption thathyperbolic geometry underlies the structure of these networks.
Distance Distribution between Complex Network Nodes in Hyperbolic Space
• Computer Science
Complex Syst.
• 2016
The probability density for the approximate hyperbolic distance between N points, distributed quasi-uniformly at random in a disk of radius R ~ lnN, is determined in this paper, together with other density functions needed to derive this result.
Clustering and the Hyperbolic Geometry of Complex Networks
• Computer Science, Mathematics
WAW
• 2014
This paper does a rigorous analysis of clustering and characterize the global clustering coefficient in terms of the parameters of the model and shows how the global clusters can be tuned by these parameters, giving an explicit formula.
From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
This work states that hyperbolic geometry forms the basis of a natural and explanatory model for real-world networks and is well-suited for metric embeddings, which have a variety of algorithmic applications ranging from approximations based on efficient geometric algorithms to greedy routing solely usinghyperbolic coordinates for navigation decisions.
Typical distances in a geometric model for complex networks
• Computer Science, Mathematics
Internet Math.
• 2017
A further property is shown: the distance between two uniformly chosen vertices that belong to the same component is doubly logarithmic in $N$, i.e., the graph is an ~\emph{ultra-small world}.
Emergent Hyperbolic Network Geometry
• Computer Science
Scientific reports
• 2017
This work shows that an hyperbolic network geometry emerges spontaneously from models of growing simplicial complexes that are purely combinatorial, and investigates the nature of the emergent geometry of complex networks and whether this geometry isHyperbolic.
Network Geometry and Complexity
• Computer Science
Journal of Statistical Physics
• 2018
This work investigates the rich interplay between emergent network geometry of higher order networks and their complexity in the framework of a non-equilibrium model called Network Geometry with Flavor and relates the spectral dimension of the higher-order network to the dimension and nature of its building blocks.
The modularity of random graphs on the hyperbolic plane
• Computer Science, Mathematics
J. Complex Networks
• 2021
This paper investigates the modularity of a recent probabilistic model of complex networks introduced by Krioukov et al. and shows that, in this regime, it converges to 1 in probability.
Coarse geometry of evolving networks
• Mathematics
J. Complex Networks
• 2018
This paper investigates edge-based properties, and the Euler characteristic of a network as a global characteristic is defined directly directly, using a construction of Bloch which yields a discrete Gauß-Bonnet theorem.

## References

SHOWING 1-10 OF 156 REFERENCES
On curvature and temperature of complex networks
• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2009
It is shown that heterogeneous degree distributions in observed scale-free topologies of complex networks can emerge as a consequence of the exponential expansion of hidden hyperbolic space and a remarkable congruency between the embedding and the model is found.
Entropy of network ensembles.
• G. Bianconi
• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2009
The structural entropy is defined and evaluated, i.e., the entropy of the ensembles of undirected uncorrelated simple networks with given degree sequence, and a solution to the paradox is proposed by proving that scale-free degree distributions are the most likely degree distribution with the corresponding value of the structural entropy.
Self-similarity of complex networks and hidden metric spaces
• Computer Science
Physical review letters
• 2008
These findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization.
Statistical mechanics of networks.
• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2004
We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of
Community structure in social and biological networks
• Computer Science
Proceedings of the National Academy of Sciences of the United States of America
• 2002
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Elements of Asymptotic Geometry
• Mathematics
• 2007
Asymptotic geometry is the study of metric spaces from a large scale point of view, where the local geometry does not come into play. An important class of model spaces are the hyperbolic spaces (in
Entropy measures for networks: toward an information theory of complex topologies.
• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2009
The quantities introduced here will play a crucial role for the formulation of null models of networks through maximum-entropy arguments and will contribute to inference problems emerging in the field of complex networks.
Tuning clustering in random networks with arbitrary degree distributions.
• Computer Science
Physical review. E, Statistical, nonlinear, and soft matter physics
• 2005
A generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable and an universal relation among clustering and degree-degree correlations for all networks is unveiled.
Hierarchy measures in complex networks.
• Computer Science
Physical review letters
• 2004
This work proposes a simple dynamical process used to construct networks which are either maximally or minimally hierarchical, and shows the extent of topological hierarchy to smoothly decline with gamma, the exponent of a degree distribution.
Hierarchical structure and the prediction of missing links in networks
• Computer Science
Nature
• 2008
This work presents a general technique for inferring hierarchical structure from network data and shows that the existence of hierarchy can simultaneously explain and quantitatively reproduce many commonly observed topological properties of networks.