The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Emergent Hyperbolic Network Geometry
Open accessAbstract
A large variety of interacting complex systems are characterized by interactions occurring between more than two nodes. These systems are described by simplicial complexes. Simplicial complexes are formed by simplices (nodes, links, triangles, tetrahedra etc.) that have a natural geometric interpretation. As such simplicial complexes are widely used in quantum gravity approaches that involve a discretization of spacetime. Here, by extending our knowledge of growing complex networks to growing simplicial complexes we investigate the nature of the emergent geometry of complex networks and explore whether this geometry is hyperbolic. Specifically we show that an hyperbolic network geometry emerges spontaneously from models of growing simplicial complexes that are purely combinatorial. The statistical and geometrical properties of the growing simplicial complexes strongly depend on their dimensionality and display the major universal properties of real complex networks (scale-free degree distribution, small-world and communities) at the same time. Interestingly, when the network dynamics includes an heterogeneous fitness of the faces, the growing simplicial complex can undergo phase transitions that are reflected by relevant changes in the network geometry.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
Mucha, P. J., Richardson, T., Macon, K., Porter, M. A., & Onnela, J.-P. (2010) · Science · doi:10.1126/science.1184819 · Cited by 2,123
Gromov, M. (1987) · Mathematical Sciences Research Institute Publications · doi:10.1007/978-1-4613-9586-7_3 · Cited by 1,817
Bose-Einstein Condensation in Complex Networks
Bianconi, G., & Barabási, A.-L. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5632 · Cited by 808
Self-citationPopularity versus similarity in growing networks
Papadopoulos, F., Kitsak, M., Serrano, M. Á., Boguñá, M., & Krioukov, D. (2012) · Nature · doi:10.1038/nature11459 · Cited by 634
Navigability of complex networks
Boguñá, M., Krioukov, D., & Claffy, K. C. (2009) · Nature Physics · doi:10.1038/nphys1130 · Cited by 486
Sustaining the Internet with hyperbolic mapping
Boguñá, M., Papadopoulos, F., & Krioukov, D. (2010) · Nature Communications · doi:10.1038/ncomms1063 · Cited by 463 · cited 1×
“Characterizing the hyperbolicity of networks is not only a fundamental theoretical question, but it can also have practical implications as it can be used to improve significantly the navigability on such networks [29, 30].”
BackgroundAndrade, J. S., Herrmann, H. J., Andrade, R. F. S., & da Silva, L. R. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.018702 · Cited by 398
Size-dependent degree distribution of a scale-free growing network
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2001) · Physical Review E · doi:10.1103/physreve.63.062101 · Cited by 311
Cited by
The physics of higher-order interactions in complex systems
Battiston, F., Amico, E., Barrat, A., Bianconi, G., Ferraz de Arruda, G., Franceschiello, B., Iacopini, I., Kéfi, S., Latora, V., Moreno, Y., et al. (2021) · Nature Physics · doi:10.1038/s41567-021-01371-4 · Cited by 932
Self-citationThe structure and dynamics of networks with higher order interactions
Boccaletti, S., De Lellis, P., del Genio, C. I., Alfaro-Bittner, K., Criado, R., Jalan, S., & Romance, M. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.04.002 · Cited by 364
Multilayer Networks: Structure and Function
Bianconi, G. (2018) · doi:10.1093/oso/9780198753919.001.0001 · Cited by 334
Self-citationExplosive Higher-Order Kuramoto Dynamics on Simplicial Complexes
Millán, A. P., Torres, J. J., & Bianconi, G. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.218301 · Cited by 326
Self-citationBianconi, G. (2021) · doi:10.1017/9781108770996 · Cited by 223
Self-citation
Metadata
- Authors
- Bianconi, G., & Rahmede, C.
- Venue
- Scientific Reports
- Published
- 2017-02-07
- Volume
- 7
- Issue
- 1
- Pages
- 41974-41974
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W2563371586
- Cited by
- 164
- References
- 14
- FWCI
- 13.61
- Type
- journal article
- Language
- en
- Open access
- gold
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: Emergent Hyperbolic Network Geometry. https://app.cochat.ai/papers/10.1038/srep41974
- The paper
- Bianconi, G., & Rahmede, C. (2017). Emergent Hyperbolic Network Geometry. Scientific Reports. https://doi.org/10.1038/srep41974
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.