The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Path finding strategies in scale-free networks
Open accessAbstract
We numerically investigate the scale-free network model of Barabási and Albert [A. L. Barabási and R. Albert, Science 286, 509 (1999)] through the use of various path finding strategies. In real networks, global network information is not accessible to each vertex, and the actual path connecting two vertices can sometimes be much longer than the shortest one. A generalized diameter depending on the actual path finding strategy is introduced, and a simple strategy, which utilizes only local information on the connectivity, is suggested and shown to yield small-world behavior: the diameter D of the network increases logarithmically with the network size N, the same as is found with global strategy. If paths are sought at random, D is equivalent to N(0.5) is found.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Self-citation
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Identity and Search in Social Networks
Watts, D. J., Dodds, P. S., & Newman, M. E. J. (2002) · Science · doi:10.1126/science.1070120 · Cited by 1,052
Geographic routing in social networks
Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., & Tomkins, A. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0503018102 · Cited by 838
Modelling dynamical processes in complex socio-technical systems
Vespignani, A. (2012) · Nature Physics · doi:10.1038/nphys2160 · Cited by 652
Traffic dynamics based on local routing protocol on a scale-free network
Wang, W.-X., Wang, B.-H., Yin, C.-Y., Xie, Y.-B., & Zhou, T. (2006) · Physical Review E · doi:10.1103/physreve.73.026111 · Cited by 382
Metadata
- Authors
- Kim, B. J., Yoon, C. N., Han, S. K., & Jeong, H.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2002-01-23
- Volume
- 65
- Issue
- 2
- Pages
- 027103-027103
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2040539731
- Cited by
- 174
- References
- 1
- FWCI
- 7.10
- 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: Path finding strategies in scale-free networks. https://app.cochat.ai/papers/10.1103/physreve.65.027103
- The paper
- Kim, B. J., Yoon, C. N., Han, S. K., & Jeong, H. (2002). Path finding strategies in scale-free networks. Physical Review E. https://doi.org/10.1103/physreve.65.027103
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.