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
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
Vázquez, A. (2003) · Physical Review E · doi:10.1103/physreve.67.056104 · Cited by 563
Resisting structural re-identification in anonymized social networks
Hay, M., Miklau, G., Jensen, D., Towsley, D., & Weis, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453873 · Cited by 549
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
Newman, M. E. J. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.058701 · Cited by 497
Properties of highly clustered networks
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.68.026121 · Cited by 493
Attack Robustness and Centrality of Complex Networks
Iyer, S., Killingback, T., Sundaram, B., & Wang, Z. (2013) · PLoS ONE · doi:10.1371/journal.pone.0059613 · Cited by 472
Mathematical results on scale‐free random graphs
Bollobás, B., & Riordan, O. M. (2002) · Handbook of Graphs and Networks · doi:10.1002/3527602755.ch1 · Cited by 463
Streaming graph partitioning for large distributed graphs
Stanton, I., & Kliot, G. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339722 · Cited by 446
Kurant, M., & Thiran, P. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.138701 · Cited by 421
Growth of the flickr social network
Mislove, A., Koppula, H. S., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2008) · Proceedings of the first workshop on Online social networks · doi:10.1145/1397735.1397742 · Cited by 413
Complex Networks: Principles, Methods and Applications
Latora, V., Nicosia, V., & Russo, G. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316216002 · Cited by 372
How digital media drive affective polarization through partisan sorting
Törnberg, P. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2207159119 · Cited by 438
Bipartite graphs as models of complex networks
Guillaume, J.-L., & Latapy, M. (2006) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.04.047 · Cited by 282
Approximating Clustering Coefficient and Transitivity
Schank, T., & Wagner, D. (2005) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00108 · Cited by 274
Triadic closure as a basic generating mechanism of communities in complex networks
Bianconi, G., Darst, R. K., Iacovacci, J., & Fortunato, S. (2014) · Physical Review E · doi:10.1103/physreve.90.042806 · Cited by 268
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
“5, and Holme–Kim scale-free networks (HK) [42] with triad formation probability 0.”
BackgroundThe memory of science: Inflation, myopia, and the knowledge network
Pan, R. K., Petersen, A. M., Pammolli, F., & Fortunato, S. (2018) · Journal of Informetrics · doi:10.1016/j.joi.2018.06.005 · Cited by 79
Graph theory and stability analysis of protein complex interaction networks
Huang, C., Chen, T., & Ng, K. (2016) · IET Systems Biology · doi:10.1049/iet-syb.2015.0007 · Cited by 18
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.