The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Growing scale-free networks with tunable clustering
Open accessAbstract
We extend the standard scale-free network model to include a "triad formation step." We analyze the geometric properties of networks generated by this algorithm both analytically and by numerical calculations, and find that our model possesses the same characteristics as the standard scale-free networks such as the power-law degree distribution and the small average geodesic length, but with the high clustering at the same time. In our model, the clustering coefficient is also shown to be tunable simply by changing a control parameter---the average number of triad formation trials per time step.
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
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Mean-field theory for scale-free random networks
Barabási, A.-L., Albert, R., & Jeong, H. (1999) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,255
Clustering and preferential attachment in growing networks
Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.025102 · Cited by 2,093
How popular is your paper? An empirical study of the citation distribution
Redner, S. (1998) · The European Physical Journal B · doi:10.1007/s100510050359 · Cited by 1,509
Wilson, R. J. (1972) · Cited by 926
Frank, O., & Strauss, D. (1986) · Journal of the American Statistical Association · doi:10.1080/01621459.1986.10478342 · Cited by 893
Clustering and Structural Balance in Graphs
Davis, J. A. (1967) · Human Relations · doi:10.1177/001872676702000206 · Cited by 818
Newman, M. E. J. (2000) · Journal of Statistical Physics · doi:10.1023/a:1026485807148 · Cited by 716
Spread of information through a population with socio-structural bias: I. Assumption of transitivity
Rapoport, A. (1953) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02476440 · Cited by 404
Size-dependent degree distribution of a scale-free growing network
Dorogovtsev, S. N., Mendes, J. F. F., & Samukhin, A. N. (2001) · Physical Review E · doi:10.1103/physreve.63.062101 · Cited by 311
On a General Class of Models for Interaction
Strauss, D. (1986) · SIAM Review · doi:10.1137/1028156 · Cited by 247
Contribution to the theory of random and biased nets
Rapoport, A. (1957) · The Bulletin of Mathematical Biophysics · doi:10.1007/bf02478417 · Cited by 227
A study of a biased friendship net
Fararo, T. J., & Sunshine, M. H. (1964) · Medical Entomology and Zoology · Cited by 152
Topological properties of citation and metabolic networks
Bilke, S., & Peterson, C. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.64.036106 · Cited by 112
Freeman, L. C., Mitchell, J. C., & Ziegler, R. (1978) · Social Networks · doi:10.1016/0378-8733(78)90010-2 · Cited by 54
A study of a large sociogram II. Elimination of free parameters
Foster, C. C., Rapoport, A., & Orwant, C. J. (2007) · Systems Research and Behavioral Science · doi:10.1002/bs.3830080107 · Cited by 50
Random and biased networks: simulations and approximations
Skvoretz, J. V. (1985) · Social Networks · doi:10.1016/0378-8733(85)90016-4 · Cited by 44
Research works printed but not linked: 1
- Y. Fang, 2001, Scientometrics, 50, 273, 10.1023/A:1010573723540 · doi:10.1023/a:1010573723540
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Hierarchical organization in complex networks
Ravasz, E., & Barabási, A.-L. (2003) · Physical Review E · doi:10.1103/physreve.67.026112 · Cited by 2,160
Attack vulnerability of complex networks
Holme, P., Kim, B. J., Yoon, C. N., & Han, S. K. (2002) · Physical Review E · doi:10.1103/physreve.65.056109 · Cited by 1,891
Self-citationThe Kuramoto model in complex networks
Rodrigues, F. A., Peron, T. K. D., Ji, P., & Kurths, J. (2016) · Physics Reports · doi:10.1016/j.physrep.2015.10.008 · Cited by 1,040
Analyzing and modeling real-world phenomena with complex networks: a survey of applications
Costa, L. D. F., Oliveira, O. N., Travieso, G., Rodrigues, F. A., Villas Boas, P. R., Antiqueira, L., Viana, M. P., & Correa Rocha, L. E. (2011) · Advances in Physics · doi:10.1080/00018732.2011.572452 · Cited by 800
Metadata
- Authors
- Holme, P., & Kim, B. J.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2002-01-11
- Volume
- 65
- Issue
- 2
- Pages
- 026107-026107
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W1983275606
- Cited by
- 1,088
- References
- 20
- FWCI
- 10.03
- 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.