Optimal traffic networks
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Inspired by studies on the airports’ network and the physical Internet, we propose a general model of weighted networks via an optimization principle. The topology of the optimal network turns out to be a spanning tree that minimizes a combination of topological and metric quantities. It is characterized by strongly heterogeneous traffic, non-trivial correlations between distance and traffic and a broadly distributed centrality. A clear spatial hierarchical organization, with local hubs distributing traffic in smaller regions, emerges as a result of the optimization. Varying the parameters of the cost function, different classes of trees are recovered, including in particular the minimum spanning tree and the shortest path tree. These results suggest that a variational approach represents an alternative and possibly very meaningful path to the study of the structure of complex weighted networks.
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
A General Model for the Origin of Allometric Scaling Laws in Biology
West, G. B., Brown, J. H., & Enquist, B. J. (1997) · Science · doi:10.1126/science.276.5309.122 · Cited by 5,016
Cited by
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
Self-citationExtracting the multiscale backbone of complex weighted networks
Serrano, M. Á., Boguñá, M., & Vespignani, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0808904106 · Cited by 892
Characterizing the human mobility pattern in a large street network
Jiang, B., Yin, J., & Zhao, S. (2009) · Physical Review E · doi:10.1103/physreve.80.021136 · Cited by 296
Exploring the Morphospace of Communication Efficiency in Complex Networks
Goñi, J., Avena-Koenigsberger, A., Velez de Mendizabal, N., van den Heuvel, M. P., Betzel, R. F., & Sporns, O. (2013) · PLoS ONE · doi:10.1371/journal.pone.0058070 · Cited by 158
Modeling the Growth of Transportation Networks: A Comprehensive Review
Xie, F., & Levinson, D. (2009) · Networks and Spatial Economics · doi:10.1007/s11067-007-9037-4 · Cited by 163
Metadata
- Authors
- Barthélemy, M., & Flammini, A.
- Venue
- Journal of Statistical Mechanics: Theory and Experiment
- Publisher
- IOP Publishing
- Published
- 2006-07-24
- Volume
- 2006
- Issue
- 07
- Pages
- L07002-L07002
- ISSN
- 1742-5468 (ISSN-L)
- OpenAlex
- W1998166633
- Cited by
- 88
- References
- 1
- FWCI
- 3.34
- 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: Optimal traffic networks. https://app.cochat.ai/papers/10.1088/1742-5468/2006/07/l07002
- The paper
- Barthélemy, M., & Flammini, A. (2006). Optimal traffic networks. Journal of Statistical Mechanics: Theory and Experiment. https://doi.org/10.1088/1742-5468/2006/07/l07002
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.