The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Machine learning meets complex networks via coalescent embedding in the hyperbolic space
Open accessAbstract
Physicists recently observed that realistic complex networks emerge as discrete samples from a continuous hyperbolic geometry enclosed in a circle: the radius represents the node centrality and the angular displacement between two nodes resembles their topological proximity. The hyperbolic circle aims to become a universal space of representation and analysis of many real networks. Yet, inferring the angular coordinates to map a real network back to its latent geometry remains a challenging inverse problem. Here, we show that intelligent machines for unsupervised recognition and visualization of similarities in big data can also infer the network angular coordinates of the hyperbolic model according to a geometrical organization that we term “angular coalescence.” Based on this phenomenon, we propose a class of algorithms that offers fast and accurate “coalescent embedding” in the hyperbolic circle even for large networks. This computational solution to an inverse problem in physics of complex systems favors the application of network latent geometry techniques in disciplines dealing with big network data analysis including biology, medicine, and social science.
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.
Integrity signals
Registry
Cites
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.
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
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Power-Law Distributions in Empirical Data
Clauset, A., Shalizi, C. R., & Newman, M. E. J. (2009) · SIAM Review · doi:10.1137/070710111 · Cited by 8,019
The political blogosphere and the 2004 U.S. election: divided they blog
Adamic, L. A., & Glance, N. (2005) · Proceedings of the 3rd international workshop on Link discovery · doi:10.1145/1134271.1134277 · Cited by 2,619
Penrose, M. (2003) · doi:10.1093/acprof:oso/9780198506263.001.0001 · Cited by 2,480
Popularity 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
Geometric De-noising of Protein-Protein Interaction Networks
Kuchaiev, O., Rašajski, M., Higham, D. J., & Pržulj, N. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000454 · Cited by 180
Interdisciplinary and physics challenges of network theory
Bianconi, G. (2015) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/111/56001 · Cited by 126 · cited 1×
“This field has a large number of applications ranging from brain networks (Cannistraci et al. 2013a) to routing packets in the Internet (Bianconi 2015).”
Self-citation
Cited by
A Systematic Review on Supervised and Unsupervised Machine Learning Algorithms for Data Science
Alloghani, M., Al-Jumeily, D., Mustafina, J., Hussain, A., & Aljaaf, A. J. (2020) · Unsupervised and Semi-Supervised Learning · doi:10.1007/978-3-030-22475-2_1 · Cited by 702
Geom-GCN: Geometric Graph Convolutional Networks
Pei, H., Wei, B., Chang, K. C., Yu, L., & Yang, B. X. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.05287 · Cited by 396
Brain network communication: concepts, models and applications
Seguin, C., Sporns, O., & Zalesky, A. (2023) · Nature Reviews Neuroscience · doi:10.1038/s41583-023-00718-5 · Cited by 284
Modular gateway-ness connectivity and structural core organization in maritime network science
Xu, M., Pan, Q., Muscoloni, A., Xia, H., & Cannistraci, C. V. (2020) · Nature Communications · doi:10.1038/s41467-020-16619-5 · Cited by 103
Self-citationSun, K., Roy, A., & Tobin, J. M. (2024) · Journal of Critical Care · doi:10.1016/j.jcrc.2024.154792 · Cited by 28
Metadata
- Authors
- Muscoloni, A., Thomas, J. M., Ciucci, S., Bianconi, G., & Cannistraci, C. V.
- Venue
- Nature Communications
- Published
- 2017-11-20
- Volume
- 8
- Issue
- 1
- Pages
- 1615-1615
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W3099667794
- Cited by
- 187
- References
- 12
- FWCI
- 8.69
- 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: Machine learning meets complex networks via coalescent embedding in the hyperbolic space. https://app.cochat.ai/papers/10.1038/s41467-017-01825-5
- The paper
- Muscoloni, A., Thomas, J. M., Ciucci, S., Bianconi, G., & Cannistraci, C. V. (2017). Machine learning meets complex networks via coalescent embedding in the hyperbolic space. Nature Communications. https://doi.org/10.1038/s41467-017-01825-5
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.