The DOI matches its Crossref record; 2 of the 2 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.
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
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
Research works printed but not linked: 17
- M. E. J. Newman, 2000, J. Stat. Phys., 101, 819, 10.1023/A:1026485807148 · DOI · Paper page
- S. H. Strogatz, 2001, Nature (London), 410, 268, 10.1038/35065725 · DOI · Paper page
- A. Rapoport, 1953, Bull. Math. Biophys., 15, 523, 10.1007/BF02476440 · DOI · Paper page
- A. Rapoport, 1957, Bull. Math. Biophys., 19, 257, 10.1007/BF02478417 · DOI · Paper page
- J. A. Davis, 1967, Human Relations, 20, 181, 10.1177/001872676702000206 · DOI · Paper page
- I. Pool, 1978, Soc. Networks, 1, 1, 10.1016/0378-8733(78)90010-2 · DOI
- J. Skvoretz, 1985, Soc. Networks, 225, 10.1016/0378-8733(85)90016-4 · DOI
- C. C. Foster, 1963, Behav. Sci., 8, 56, 10.1002/bs.3830080107 · DOI
- O. Frank, 1986, J. Am. Stat. Assoc., 81, 832, 10.1080/01621459.1986.10478342 · DOI · Paper page
- D. J. Watts, 1998, Nature (London), 393, 440, 10.1038/30918 · DOI · Paper page
- A.-L. Barabási, 1999, Physica A, 272, 173, 10.1016/S0378-4371(99)00291-5 · DOI · Paper page
- R. Albert, 1999, Nature (London), 401, 130, 10.1038/43601 · DOI · Paper page
- M. E. J. Newman, 2001, Phys. Rev. E, 64, 025102, 10.1103/PhysRevE.64.025102 · DOI · Paper page
- D. Strauss, 1986, SIAM Rev., 28, 513, 10.1137/1028156 · DOI · Paper page
- S. Redner, 1998, Eur. Phys. J. B, 4, 131, 10.1007/s100510050359 · DOI · Paper page
- S. Bilke, 2001, Phys. Rev. E, 64, 036106, 10.1103/PhysRevE.64.036106 · DOI
- 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
- 2
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Growing scale-free networks with tunable clustering. https://app.cochat.ai/papers/10.1103/physreve.65.026107
- The paper
- Holme, P., & Kim, B. J. (2002). Growing scale-free networks with tunable clustering. Physical Review E. https://doi.org/10.1103/physreve.65.026107
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.
