The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Random Graphs with Clustering
Open accessAbstract
We offer a solution to a long-standing problem in the theory of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity--the propensity for two neighbors of a network node also to be neighbors of one another. We show how standard random-graph models can be generalized to incorporate clustering and give exact solutions for various properties of the resulting networks, including sizes of network components, size of the giant component if there is one, position of the phase transition at which the giant component forms, and position of the phase transition for percolation on the network.
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
Assortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
Self-citationHierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Self-citationNetwork Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
Self-citationResilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
A critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
Dynamical and Correlation Properties of the Internet
Pastor-Satorras, R., Vázquez, A., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.258701 · Cited by 1,466
Why social networks are different from other types of networks
Newman, M. E. J., & Park, J. (2003) · Physical Review E · doi:10.1103/physreve.68.036122 · Cited by 1,354
Self-citationGrowing scale-free networks with tunable clustering
Holme, P., & Kim, B. J. (2002) · Physical Review E · doi:10.1103/physreve.65.026107 · Cited by 1,088
Spatial Contact Models for Ecological and Epidemic Spread
Mollison, D. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01627.x · Cited by 758
On the critical behavior of the general epidemic process and dynamical percolation
Grassberger, P. (1983) · Mathematical Biosciences · doi:10.1016/0025-5564(82)90036-0 · Cited by 642
Structure of growing social networks
Jin, E. M., Girvan, M., & Newman, M. E. J. (2001) · Physical Review E · doi:10.1103/physreve.64.046132 · Cited by 505
Self-citationProperties of highly clustered networks
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.68.026121 · Cited by 493
Self-citationHighly clustered scale-free networks
Klemm, K., & Eguíluz, V. M. (2002) · Physical Review E · doi:10.1103/physreve.65.036123 · Cited by 395
Clustering in complex networks. I. General formalism
Serrano, M. Á., & Boguñá, M. (2006) · Physical Review E · doi:10.1103/physreve.74.056114 · Cited by 157
Shi, X., Adamic, L. A., & Strauss, M. J. (2006) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.11.072 · Cited by 140
Tuning clustering in random networks with arbitrary degree distributions
Serrano, M. Á., & Boguñá, M. (2005) · Physical Review E · doi:10.1103/physreve.72.036133 · Cited by 136
Solution for the properties of a clustered network
Park, J. M., & Newman, M. E. J. (2005) · Physical Review E · doi:10.1103/physreve.72.026136 · Cited by 113
Self-citationNetwork transitivity and matrix models
Burda, Z., Jurkiewicz, J., & Krzywicki, A. (2004) · Physical Review E · doi:10.1103/physreve.69.026106 · Cited by 109
Evolving Clustered Random NetworksPreprint
Bansal, S., Khandelwal, S., & Ancel, L. W. (2008) · doi:10.48550/arxiv.0808.0509 · Cited by 63
Cycle distributions in random nets
Rapoport, A. (1948) · Bulletin of Mathematical Biology · doi:10.1007/bf02477489 · Cited by 48
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
The 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
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
Robustness and resilience of complex networks
Artime, O., Grassia, M., De Domenico, M., Gleeson, J. P., Makse, H. A., Mangioni, G., Perc, M., & Radicchi, F. (2024) · Nature Reviews Physics · doi:10.1038/s42254-023-00676-y · Cited by 672
Metadata
- Authors
- Newman, M. E. J.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2009-07-27
- Volume
- 103
- Issue
- 5
- Pages
- 058701-058701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2000687288
- Cited by
- 497
- References
- 22
- FWCI
- 21.08
- 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.