The DOI matches its Crossref record; 1 of the 1 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.
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
Hierarchical 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
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
Statistical mechanics of multiplex networks: Entropy and overlap
Bianconi, G. (2013) · Physical Review E · doi:10.1103/physreve.87.062806 · Cited by 365
Percolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
The scaling of human interactions with city size
Schläpfer, M., Bettencourt, L. M. A., Grauwin, S., Raschke, M., Claxton, R., Smoreda, Z., West, G. B., & Ratti, C. (2014) · Journal of The Royal Society Interface · doi:10.1098/rsif.2013.0789 · Cited by 356
Percolation in self-similar networks
Serrano, M. Á., Krioukov, D., & Boguñá, M. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.048701 · Cited by 47
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
- 1
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Random Graphs with Clustering. https://app.cochat.ai/papers/10.1103/physrevlett.103.058701
- The paper
- Newman, M. E. J. (2009). Random Graphs with Clustering. Physical Review Letters. https://doi.org/10.1103/physrevlett.103.058701
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.
