The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Efficient routing on complex networks
Open accessAbstract
We propose a routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called efficient path, which considers the possible congestion in the nodes along actual paths. Since the nodes with the largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our strategy, can be redistributing traffic load in central nodes to other noncentral nodes. Simulation results indicate that the network capability in processing traffic is improved more than 10 times by optimizing the efficient path, which is in good agreement with the analysis.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
The architecture of complex weighted networks
Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400087101 · Cited by 4,218
Self-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650143 · Cited by 2,731
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.016132 · Cited by 2,613
Evolution and Structure of the Internet: A Statistical Physics Approach
Pastor-Satorras, R., & Vespignani, A. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511610905 · Cited by 1,310
Structure of Growing Networks with Preferential Linking
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4633 · Cited by 1,307
Cited by
Universal scaling for the dilemma strength in evolutionary games
Wang, Z., Kokubo, S., Jusup, M., & Tanimoto, J. (2015) · Physics of Life Reviews · doi:10.1016/j.plrev.2015.04.033 · Cited by 586
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs
Daly, E. M., & Haahr, M. (2009) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2008.161 · Cited by 426
Control Centrality and Hierarchical Structure in Complex Networks
Liu, Y.-Y., Slotine, J.-J., & Barabási, A.-L. (2012) · PLoS ONE · doi:10.1371/journal.pone.0044459 · Cited by 320
A spectrum of routing strategies for brain networks
Avena-Koenigsberger, A., Yan, X., Kolchinsky, A., van den Heuvel, M. P., Hagmann, P., & Sporns, O. (2019) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1006833 · Cited by 115
Metadata
- Authors
- Yan, G., Zhou, T., Hu, B., Fu, Z.-Q., & Wang, B.-H.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2006-04-07
- Volume
- 73
- Issue
- 4
- Pages
- 046108-046108
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2028069703
- Cited by
- 631
- References
- 31
- FWCI
- 24.92
- 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: Efficient routing on complex networks. https://app.cochat.ai/papers/10.1103/physreve.73.046108
- The paper
- Yan, G., Zhou, T., Hu, B., Fu, Z.-Q., & Wang, B.-H. (2006). Efficient routing on complex networks. Physical Review E. https://doi.org/10.1103/physreve.73.046108
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.
