Complex networks on hyperbolic surfaces
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We explore a novel method to generate and characterize complex networks by means of their embedding on hyperbolic surfaces. Evolution through local elementary moves allows the exploration of the ensemble of networks which share common embeddings and consequently share similar hierarchical properties. This method provides a new perspective to classify network-complexity both on local and global scale. We demonstrate by means of several examples that there is a strong relation between the network properties and the embedding surface.
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
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
Brézin, E., Itzykson, C., Parisi, G., & Zuber, J. B. (1978) · Communications in Mathematical Physics · doi:10.1007/bf01614153 · Cited by 1,479
Analytical and numerical study of a model of dynamically triangulated random surfaces
Boulatov, D. V., Kazakov, V. A., Kostov, I. K., & Migdal, A. A. (1986) · Nuclear Physics B · doi:10.1016/0550-3213(86)90578-x · Cited by 375
Cited by
A tool for filtering information in complex systems
Tumminello, M., Aste, T., Di Matteo, T., & Mantegna, R. N. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0500298102 · Cited by 901
Self-citationMultiscale Embedded Gene Co-expression Network Analysis
Song, W.-M., & Zhang, B. (2015) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004574 · Cited by 356
Geometrical structure of disordered sphere packings
Aste, T., Saadatfar, M., & Senden, T. (2005) · Physical Review E · doi:10.1103/physreve.71.061302 · Cited by 341
Self-citationNetwork geometry with flavor: From complexity to quantum geometry
Bianconi, G., & Rahmede, C. (2016) · Physical Review E · doi:10.1103/physreve.93.032315 · Cited by 150
Interdisciplinary and physics challenges of network theory
Bianconi, G. (2015) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/111/56001 · Cited by 126
Metadata
- Authors
- Aste, T., Di Matteo, T., & Hyde, S. T.
- Venue
- Physica A: Statistical Mechanics and its Applications
- Publisher
- Elsevier BV
- Published
- 2005-02
- Volume
- 346
- Issue
- 1-2
- Pages
- 20-26
- ISSN
- 0378-4371 (ISSN-L)
- OpenAlex
- W2003265371
- Cited by
- 125
- References
- 3
- FWCI
- 3.41
- 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: Complex networks on hyperbolic surfaces. https://app.cochat.ai/papers/10.1016/j.physa.2004.08.045
- The paper
- Aste, T., Di Matteo, T., & Hyde, S. T. (2005). Complex networks on hyperbolic surfaces. Physica A: Statistical Mechanics and its Applications. https://doi.org/10.1016/j.physa.2004.08.045
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.