Network Structures from Selection Principles
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
We present an analysis of the topologies of a class of networks which are optimal in terms of the requirements of having as short a route as possible between any two nodes while yet keeping the congestion in the network as low as possible. Strikingly, we find a variety of distinct topologies and novel phase transitions between them on varying the number of links per node. Our results suggest that the emergence of the topologies observed in nature may arise both from growth mechanisms and the interplay of dynamical mechanisms with a selection process.
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
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
Large-scale topological and dynamical properties of the Internet
Vázquez, A., Pastor-Satorras, R., & Vespignani, A. (2002) · Physical Review E · doi:10.1103/physreve.65.066130 · Cited by 712
Cited by
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
The complex structure of hunter–gatherer social networks
Hamilton, M. J., Milne, B. T., Walker, R. S., Burger, O., & Brown, J. H. (2007) · Proceedings of the Royal Society B: Biological Sciences · doi:10.1098/rspb.2007.0564 · Cited by 386
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
Evolving complexity: how tinkering shapes cells, software and ecological networks.
Solé, R., & Valverde, S. (2020) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2019.0325 · Cited by 37
“…networks, particularly spatial ones, require considering a conflict between efficient communication and wiring costs (Ferrer-i-Cancho and Solé 2003; Colizza et al 2004, see Seoane and Solé 2015 and references cited) or conflicts between different subparts (RasskinGutman and Esteve-Altava 2014;…”
Background
Metadata
- Authors
- Colizza, V., Banavar, J. R., Maritan, A., & Rinaldo, A.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2004-05-10
- Volume
- 92
- Issue
- 19
- Pages
- 198701-198701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2089516597
- Cited by
- 71
- References
- 2
- FWCI
- 4.55
- 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: Network Structures from Selection Principles. https://app.cochat.ai/papers/10.1103/physrevlett.92.198701
- The paper
- Colizza, V., Banavar, J. R., Maritan, A., & Rinaldo, A. (2004). Network Structures from Selection Principles. Physical Review Letters. https://doi.org/10.1103/physrevlett.92.198701
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.