Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
This paper proposes a mathematical justification of the phenomenon of extreme congestion at a very limited number of nodes in very large networks. It is argued that this phenomenon occurs as a combination of the negative curvature property of the network together with minimum-length routing. More specifically, it is shown that in a large _n_-dimensional hyperbolic ball _B_ of radius _R_ viewed as a roughly similar model of a Gromov hyperbolic network, the proportion of traffic paths transiting through a small ball near the center is Θ(1), whereas in a Euclidean ball, the same proportion scales as Θ(1/_R_ n−1). This discrepancy persists for the traffic load, which at the center of the hyperbolic ball scales as volume2(_B_), whereas the same traffic load scales as volume1+1/n (_B_) in the Euclidean ball. This provides a theoretical justification of the experimental exponent discrepancy observed by Narayan and Saniee between traffic loads in Gromov-hyperbolic networks from the Rocketfuel database and synthetic Euclidean lattice networks. It is further conjectured that for networks that do not enjoy the obvious symmetry of hyperbolic and Euclidean balls, the point of maximum traffic is near the center of mass of the network.
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
Large-scale curvature of networks
Narayan, O., & Saniee, I. (2011) · Physical Review E · doi:10.1103/physreve.84.066108 · Cited by 145 · cited 11×
“In the same paper [20], Narayan and Saniee provide experimental evidence that the traffic load at the center of WattsStrogatz Small-World 2-dimensional networks scales as N.”
BackgroundMethodResultInfluentialCombinatorial curvature for planar graphs
Higuchi, Y. (2001) · Journal of Graph Theory · doi:10.1002/jgt.10004 · Cited by 97
Cited by
Sustaining the Internet with hyperbolic mapping
Boguñá, M., Papadopoulos, F., & Krioukov, D. (2010) · Nature Communications · doi:10.1038/ncomms1063 · Cited by 463
Interdisciplinary and physics challenges of network theory
Bianconi, G. (2015) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/111/56001 · Cited by 126
Emergent Complex Network Geometry
Wu, Z., Menichetti, G., Rahmede, C., & Bianconi, G. (2015) · Scientific Reports · doi:10.1038/srep10073 · Cited by 98
Complex quantum network geometries: Evolution and phase transitions
Bianconi, G., Rahmede, C., & Wu, Z. (2015) · Physical Review E · doi:10.1103/physreve.92.022815 · Cited by 63
Metadata
- Authors
- Jonckheere, E., Lou, M., Bonahon, F., & Baryshnikov, Y.
- Venue
- Internet Mathematics
- Publisher
- Internet Mathematics
- Published
- 2011-03-14
- Volume
- 7
- Issue
- 1
- Pages
- 1-27
- ISSN
- 1542-7951 (ISSN-L)
- 1944-9488
- OpenAlex
- W2009182597
- Cited by
- 72
- References
- 2
- FWCI
- 5.73
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks. https://app.cochat.ai/papers/10.1080/15427951.2010.554320
- The paper
- Jonckheere, E., Lou, M., Bonahon, F., & Baryshnikov, Y. (2011). Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks. Internet Mathematics. https://doi.org/10.1080/15427951.2010.554320
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.