Hyperbolic Geometry of Complex Networks

By Dmitri V. Krioukov, Fragkiskos Papadopoulos, M. Kitsak, Amin Vahdat, Marián Boguñá. 2010

1,192 citations recorded by the source corpus.

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 heterogeneous, then the network has an effective hyperbolic geometry underneath. We then establish a mapping between our geometric framework and statistical mechanics of complex networks. This mapping interprets edges in a network as noninteracting fermions whose energies are hyperbolic distances between nodes, while the auxiliary fields coupled to edges are linear functions of these energies or distances. The geometric network ensemble subsumes the standard configuration model and classical random graphs as two limiting cases with degenerate geometric structures. Finally, we show that targeted transport processes without global topology knowledge, made possible by our geometric framework, are maximally efficient, according to all efficiency measures, in networks with strongest heterogeneity and clustering, and that this efficiency is remarkably robust with respect to even catastrophic disturbances and damages to the network structure.

Subfields: Computational Theory and Mathematics, Mathematical Physics, Statistical and Nonlinear Physics, Graph Learning, Network Science & Complex Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Octavian-Eugen Ganea
  2. Gary Bécigneul
  3. A. Tifrea
  4. Thomas Hofmann
  5. Christopher R'e
  6. Rex Ying
  7. Christopher De Sa
  8. Jure Leskovec

In Mathematical Physics

  1. Thomas Hofmann
  2. Edwin Robert Hancock
  3. Jure Leskovec
  4. Nando de Freitas
  5. Ivan V. Oseledets
  6. Christopher De Sa
  7. Caglar Gulcehre
  8. Razvan Pascanu

In Statistical and Nonlinear Physics

  1. Jure Leskovec
  2. Rex Ying
  3. Christopher R'e
  4. Xiao Wang
  5. Wenwu Zhu
  6. Peng Cui
  7. Jian Pei
  8. Ines Chami

In Graph Learning

  1. William L. Hamilton
  2. Jure Leskovec
  3. Rex Ying
  4. Peng Cui
  5. Wenwu Zhu
  6. Xiao Wang
  7. Jian Pei
  8. Christopher R'e

In Network Science & Complex Systems

  1. Peng Cui
  2. Wenwu Zhu
  3. Remco van der Hofstad
  4. Jian Pei
  5. Xiao Wang
  6. Jure Leskovec
  7. Marc Barthelemy
  8. Qi Liu

Citations in the corpus