The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Universal Behavior of Load Distribution in Scale-Free Networks
Open accessAbstract
We study a problem of data packet transport in scale-free networks whose degree distribution follows a power law with the exponent gamma. Load, or "betweenness centrality," of a vertex is the accumulated total number of data packets passing through that vertex when every pair of vertices sends and receives a data packet along the shortest path connecting the pair. It is found that the load distribution follows a power law with the exponent delta approximately 2.2(1), insensitive to different values of gamma in the range, 2 < gamma < or = 3, and different mean degrees, which is valid for both undirected and directed cases. Thus, we conjecture that the load exponent is a universal quantity to characterize scale-free networks.
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
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
Classes of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
Simple Lessons from Complexity
Goldenfeld, N., & Kadanoff, L. P. (1999) · Science · doi:10.1126/science.284.5411.87 · Cited by 554
Research works printed but not linked: 20
- S. H. Strogatz, 2001, Nature (London), 410, 268, 10.1038/35065725 · DOI · Paper page
- P. Erdös, 1960, Publ. Math. Inst. Hung. Acad. Sci. Ser. A, 5, 17
- D. J. Watts, 1998, Nature (London), 393, 440, 10.1038/30918 · DOI · Paper page
- P. L. Krapivsky, 2000, Phys. Rev. Lett., 85, 4629, 10.1103/PhysRevLett.85.4629 · DOI · Paper page
- P. L. Krapivsky, 2001, Phys. Rev. E, 63, 066123, 10.1103/PhysRevE.63.066123 · DOI · Paper page
- S. N. Dorogovtsev, 2000, Phys. Rev. Lett., 85, 4633, 10.1103/PhysRevLett.85.4633 · DOI · Paper page
- A.-L. Barabási, 1999, Physica (Amsterdam), 272A, 173, 10.1016/S0378-4371(99)00291-5 · DOI · Paper page
- R. Albert, 1999, Nature (London), 401, 130, 10.1038/43601 · DOI · Paper page
- D. Butler, 2000, Nature (London), 405, 112, 10.1038/35012148 · DOI
- A. Broder, 2000, Comput. Networks, 33, 309, 10.1016/S1389-1286(00)00083-9 · DOI · Paper page
- E. W. Zegura, 1997, IEEE/ACM Trans. Network, 5, 770, 10.1109/90.650138 · DOI · Paper page
- M. Faloutsos, 1999, Comput. Commun. Rev., 29, 251, 10.1145/316194.316229 · DOI · Paper page
- S. Redner, 1998, Eur. Phys. J. B, 4, 131, 10.1007/s100510050359 · DOI · Paper page
- M. E. J. Newman, 2001, Proc. Natl. Acad. Sci. U.S.A., 98, 404, 10.1073/pnas.98.2.404 · DOI · Paper page
- M. E. J. Newman, 2001, Phys. Rev. E, 64, 016131, 10.1103/PhysRevE.64.016131 · DOI · Paper page
- M. E. J. Newman, 2001, Phys. Rev. E, 64, 016132, 10.1103/PhysRevE.64.016132 · DOI · Paper page
- H. Jeong, 2000, Nature (London), 407, 651, 10.1038/35036627 · DOI · Paper page
- L. C. Freeman, 1977, Sociometry, 40, 35, 10.2307/3033543 · DOI · Paper page
- R. Kumar, 2000, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000
- R. Pastor-Satorras, 2001, Phys. Rev. E, 63, 066117, 10.1103/PhysRevE.63.066117 · DOI · Paper page
Cited by
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
Catastrophic cascade of failures in interdependent networks
Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E., & Havlin, S. (2010) · Nature · doi:10.1038/nature08932 · Cited by 4,513
Statistical physics of social dynamics
Castellano, C., Fortunato, S., & Loreto, V. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.591 · Cited by 4,119
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
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
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
Cascade-based attacks on complex networks
Motter, A. E., & Lai, Y.-C. (2002) · Physical Review E · doi:10.1103/physreve.66.065102 · Cited by 1,929
Random Walks on Complex Networks
Noh, J. D., & Rieger, H. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.118701 · Cited by 1,148
Gong, G., He, Y., Concha, L., Lebel, C., Gross, D. W., Evans, A. C., & Beaulieu, C. (2009) · Cerebral Cortex · doi:10.1093/cercor/bhn102 · Cited by 1,112
Betweenness centrality in large complex networks
Barthélemy, M. (2004) · The European Physical Journal B · doi:10.1140/epjb/e2004-00111-4 · Cited by 804
Scale-Free Networks from Varying Vertex Intrinsic Fitness
Caldarelli, G., Capocci, A., De Los Rios, P., & Muñoz, M. A. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.258702 · Cited by 794
Cascade Control and Defense in Complex Networks
Motter, A. E. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.098701 · Cited by 776
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
Hierarchy Measure for Complex Networks
Mones, E., Vicsek, L., & Vicsek, T. (2012) · PLoS ONE · doi:10.1371/journal.pone.0033799 · Cited by 259
Large-scale curvature of networks
Narayan, O., & Saniee, I. (2011) · Physical Review E · doi:10.1103/physreve.84.066108 · Cited by 145
Strategy evolution on dynamic networks
Su, Q., McAvoy, A., & Plotkin, J. B. (2023) · Nature Computational Science · doi:10.1038/s43588-023-00509-z · Cited by 97
“1, Barabási-Albert scale-free networks (BA) [41], Goh-Kahng-Kim scale-free networks (GKK) [38] with exponent 2.”
BackgroundMarin, E. C., Morris, B. J., Stürner, T., Champion, A. S., Krzeminski, D., Badalamente, G., Gkantia, M., Dunne, C. R., Eichler, K., Takemura, S.-Y., et al. (2024) · doi:10.7554/elife.97766.1 · Cited by 44
Hierarchy in directed random networks
Mones, E. (2013) · Physical Review E · doi:10.1103/physreve.87.022817 · Cited by 16
Marin, E. C., Morris, B. J., Stürner, T., Champion, A. S., Krzeminski, D., Badalamente, G., Gkantia, M., Dunne, C. R., Eichler, K., Takemura, S.-Y., et al. (2024) · eLife · doi:10.7554/elife.97766 · Cited by 13
Metadata
- Authors
- Goh, K.-I., Kahng, B., & Kim, D.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2001-12-12
- Volume
- 87
- Issue
- 27
- Pages
- 278701-278701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2062215476
- Cited by
- 1,246
- References
- 3
- FWCI
- 17.87
- 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
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.
