The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Optimal Paths in Disordered Complex Networks
Open accessAbstract
We study the optimal distance in networks, ${\ensuremath{\ell}}_{\mathrm{o}\mathrm{p}\mathrm{t}}$, defined as the length of the path minimizing the total weight, in the presence of disorder. Disorder is introduced by assigning random weights to the links or nodes. For strong disorder, where the maximal weight along the path dominates the sum, we find that ${\ensuremath{\ell}}_{\mathrm{o}\mathrm{p}\mathrm{t}}\ensuremath{\sim}{N}^{1/3}$ in both Erd\ifmmode \mbox{\H{o}}\else \H{o}\fi{}s-R\'enyi (ER) and Watts-Strogatz (WS) networks. For scale-free (SF) networks, with degree distribution $P(k)\ensuremath{\sim}{k}^{\ensuremath{-}\ensuremath{\lambda}}$, we find that ${\ensuremath{\ell}}_{\mathrm{o}\mathrm{p}\mathrm{t}}$ scales as ${N}^{(\ensuremath{\lambda}\ensuremath{-}3)/(\ensuremath{\lambda}\ensuremath{-}1)}$ for $3<\ensuremath{\lambda}<4$ and as ${N}^{1/3}$ for $\ensuremath{\lambda}\ensuremath{\ge}4$. Thus, for these networks, the small-world nature is destroyed. For $2<\ensuremath{\lambda}<3$, our numerical results suggest that ${\ensuremath{\ell}}_{\mathrm{o}\mathrm{p}\mathrm{t}}$ scales as ${ln}^{\ensuremath{\lambda}\ensuremath{-}1}N$. We also find numerically that for weak disorder ${\ensuremath{\ell}}_{\mathrm{o}\mathrm{p}\mathrm{t}}\ensuremath{\sim}\mathrm{ln}N$ for both the ER and WS models as well as for SF 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
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Cited by
Network biology: understanding the cell's functional organization
Barabási, A.-L., & Oltvai, Z. N. (2004) · Nature Reviews Genetics · doi:10.1038/nrg1272 · Cited by 7,903
Synchronization in complex networks
Arenas, A., Díaz-Guilera, A., Kurths, J., Moreno, Y., & Zhou, C. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.002 · Cited by 3,713
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
Self-similarity of complex networks
Song, C., Havlin, S., & Makse, H. A. (2005) · Nature · doi:10.1038/nature03248 · Cited by 1,495
Self-citation
Metadata
- Authors
- Braunstein, L. A., Buldyrev, S. V., Cohen, R., Havlin, S., & Stanley, H. E.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2003-10-17
- Volume
- 91
- Issue
- 16
- Pages
- 168701-168701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2159644837
- Cited by
- 187
- References
- 1
- FWCI
- 11.90
- 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 Paths in Disordered Complex Networks. https://app.cochat.ai/papers/10.1103/physrevlett.91.168701
- The paper
- Braunstein, L. A., Buldyrev, S. V., Cohen, R., Havlin, S., & Stanley, H. E. (2003). Optimal Paths in Disordered Complex Networks. Physical Review Letters. https://doi.org/10.1103/physrevlett.91.168701
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.