The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Growing scale-free networks with small-world behavior
Open accessAbstract
In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small-world effect. While the average shortest path length increases logarithmically as in random networks, the clustering coefficient assumes a large value independent of system size. We derive analytical expressions for the clustering coefficient in two limiting cases: random [C approximately (ln N)(2)/N] and highly clustered (C=5/6) scale-free 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
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
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
(2017) · The SAGE Encyclopedia of Communication Research Methods · doi:10.4135/9781483381411.n575 · Cited by 6,008
Lethality and centrality in protein networks
Jeong, H., Mason, S. P., Barabási, A.-L., & Oltvai, Z. N. (2001) · Nature · doi:10.1038/35075138 · Cited by 5,287
The Large-Scale Organization of Metabolic Networks
Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35036627 · Cited by 4,972
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
SIMON, H. A. (1955) · Biometrika · doi:10.1093/biomet/42.3-4.425 · Cited by 2,771
Cited by
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
A simple rule for the evolution of cooperation on graphs and social networks
Ohtsuki, H., Hauert, C., Lieberman, E., & Nowak, M. A. (2006) · Nature · doi:10.1038/nature04605 · Cited by 2,208
“Prob pAA = 2kA kN = pB k! kA!kB! qA|B kAqB|BkB kAfA kAfA + kBfB . ( 6 )”
Network ‘Small-World-Ness’: A Quantitative Method for Determining Canonical Network Equivalence
Humphries, M. D., & Gurney, K. (2008) · PLoS ONE · doi:10.1371/journal.pone.0002051 · Cited by 1,442
“We created 5 networks for every value of n[ 500,750,1000,1500,2000 1⁄2 using a generalized form of the KlemmEguiluz model (GKE) [34,35], setting d = 3 so that the resulting networks had the same mean degree (,6) as we found for the real-world systems.”
BackgroundMethodComparing Brain Networks of Different Size and Connectivity Density Using Graph Theory
van Wijk, B. C. M., Stam, C. J., & Daffertshofer, A. (2010) · PLoS ONE · doi:10.1371/journal.pone.0013701 · Cited by 1,161
Heterogeneity in Oscillator Networks: Are Smaller Worlds Easier to Synchronize?
Nishikawa, T., Motter, A. E., Lai, Y.-C., & Hoppensteadt, F. C. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.014101 · Cited by 839
Meeting Strangers and Friends of Friends: How Random Are Social Networks?
Jackson, M. O., & Rogers, B. W. (2007) · American Economic Review · doi:10.1257/aer.97.3.890 · Cited by 633
Evolutionary dynamics on any population structure
Allen, B., Lippner, G., Chen, Y.-T., Fotouhi, B., Momeni, N., Yau, S.-T., & Nowak, M. A. (2017) · Nature · doi:10.1038/nature21723 · Cited by 534
A complex network approach to supply chain network theory
Hearnshaw, E. J. S., & Wilson, M. M. J. (2013) · International Journal of Operations & Production Management · doi:10.1108/01443571311307343 · Cited by 487
Efficiency of scale-free networks: error and attack tolerance
Crucitti, P., Latora, V., Marchiori, M., & Rapisarda, A. (2003) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)01545-5 · Cited by 483
Assessing experimentally derived interactions in a small world
Goldberg, D. S., & Roth, F. P. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0735871100 · Cited by 400
Epidemic Threshold in Structured Scale-Free Networks
Eguíluz, V. M., & Klemm, K. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.108701 · Cited by 353
Self-citationVoter model dynamics in complex networks: Role of dimensionality, disorder, and degree distribution
Suchecki, K., Eguíluz, V. M., & San Miguel, M. (2005) · Physical Review E · doi:10.1103/physreve.72.036132 · Cited by 286
Self-citationThe Economics of Social Networks
Jackson, M. O. (2013) · Advances in Economics and Econometrics · doi:10.1017/cbo9781139052269.003 · Cited by 264
Coevolutionary networks with homophily and heterophily
Kimura, D., & Hayakawa, Y. (2008) · Physical Review E · doi:10.1103/physreve.78.016103 · Cited by 107
Metadata
- Authors
- Klemm, K., & Eguíluz, V. M.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2002-05-08
- Volume
- 65
- Issue
- 5
- Pages
- 057102-057102
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W2042693705
- Cited by
- 339
- References
- 17
- FWCI
- 9.61
- Type
- journal article
- Language
- en
- Open access
- bronze
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.