Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 213

The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.

Network geometry

Open access
Boguñá, Marián, Bonamassa, Ivan, De Domenico, Manlio, Havlin, Shlomo, Krioukov, Dmitri, Serrano, M. Ángeles · 2021 · Nature Reviews Physics

Abstract

Networks are finite metric spaces, with distances defined by the shortest paths between nodes. However, this is not the only form of network geometry: two others are the geometry of latent spaces underlying many networks and the effective geometry induced by dynamical processes in networks. These three approaches to network geometry are intimately related, and all three of them have been found to be exceptionally efficient in discovering fractality, scale invariance, self-similarity and other forms of fundamental symmetries in networks. Network geometry is also of great use in a variety of practical applications, from understanding how the brain works to routing in the Internet. We review the most important theoretical and practical developments dealing with these approaches to network geometry and offer perspectives on future research directions and challenges in this frontier in the study of complexity. Geometric insights into the structure and function of complex networks have led to exciting developments in network science. This Review Article summarizes progress in network geometry, its theory, and applications to biological, sociotechnical and other real-world networks. The fractal geometry of networks enables casting the self-similar symmetries underlying the organization of complex systems under the three pillars of scaling, universality and renormalization. Latent metric spaces with hyperbolic geometry provide a natural explanation for the architecture of real complex networks, including small-worldness, degree heterogeneity, clustering, community structure, symmetries and navigability. Multiscale unfolding of complex networks is possible by means of a geometric renormalization technique that uncovers self-similarity at different scales. Network dynamical processes induce kinematic distances that characterize an effective geometry of a system’s function, which cannot be obtained by purely topological latent geometry. Network geometry enhances our understanding of complex systems across their multiple scales of organization and of collective phenomena emerging from their information exchange. The fractal geometry of networks enables casting the self-similar symmetries underlying the organization of complex systems under the three pillars of scaling, universality and renormalization. Latent metric spaces with hyperbolic geometry provide a natural explanation for the architecture of real complex networks, including small-worldness, degree heterogeneity, clustering, community structure, symmetries and navigability. Multiscale unfolding of complex networks is possible by means of a geometric renormalization technique that uncovers self-similarity at different scales. Network dynamical processes induce kinematic distances that characterize an effective geometry of a system’s function, which cannot be obtained by purely topological latent geometry. Network geometry enhances our understanding of complex systems across their multiple scales of organization and of collective phenomena emerging from their information exchange.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s42254-020-00264-4

Cites

41 of 41 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 41 references

Cited by

See all 213

Metadata

Authors
Boguñá, M., Bonamassa, I., De Domenico, M., Havlin, S., Krioukov, D., & Serrano, M. Á.
Venue
Nature Reviews Physics
Published
2021-01-29
Volume
3
Issue
2
Pages
114-135
ISSN
2522-5820 (ISSN-L)
OpenAlex
W3000175145
Cited by
213
References
41
FWCI
0.96
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Network geometry. https://app.cochat.ai/papers/10.1038/s42254-020-00264-4
The paper
Boguñá, M., Bonamassa, I., De Domenico, M., Havlin, S., Krioukov, D., & Serrano, M. Á. (2021). Network geometry. Nature Reviews Physics. https://doi.org/10.1038/s42254-020-00264-4

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.