The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Percolation and epidemics in random clustered networks
Abstract
The social networks that infectious diseases spread along are typically clustered. Because of the close relation between percolation and epidemic spread, the behavior of percolation in such networks gives insight into infectious disease dynamics. A number of authors have studied percolation or epidemics in clustered networks, but the networks often contain preferential contacts in high degree nodes. We introduce a class of random clustered networks and a class of random unclustered networks with the same preferential mixing. Percolation in the clustered networks reduces the component sizes and increases the epidemic threshold compared to the unclustered networks.
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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Diekmann, O., Heesterbeek, J. A. P., & Metz, J. A. J. (1990) · Journal of Mathematical Biology · doi:10.1007/bf00178324 · Cited by 5,091
Spread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218
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
The effects of local spatial structure on epidemiological invasions
Keeling, M. J. (1999) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rspb.1999.0716 · Cited by 798
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
Properties of highly clustered networks
Newman, M. E. J. (2003) · Physical Review E · doi:10.1103/physreve.68.026121 · Cited by 493
Second look at the spread of epidemics on networks
Kenah, E., & Robins, J. M. (2007) · Physical Review E · doi:10.1103/physreve.76.036113 · Cited by 248
Epidemic models and percolation
Cardy, J. L., & Grassberger, P. (1985) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/18/6/001 · Cited by 232
Percolation and Epidemic Thresholds in Clustered Networks
Serrano, M. Á., & Boguñá, M. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.088701 · Cited by 188
Epidemic size and probability in populations with heterogeneous infectivity and susceptibility
Miller, J. C. (2007) · Physical Review E · doi:10.1103/physreve.76.010101 · Cited by 169
Self-citationFinal size distribution for epidemics
Ludwig, D. (1975) · Mathematical Biosciences · doi:10.1016/0025-5564(75)90119-4 · Cited by 136
Clustering in complex networks. II. Percolation properties
Serrano, M. Á., & Boguñá, M. (2006) · Physical Review E · doi:10.1103/physreve.74.056115 · Cited by 126
Modelling disease spread through random and regular contacts in clustered populations
Eames, K. T. D. (2007) · Theoretical Population Biology · doi:10.1016/j.tpb.2007.09.007 · Cited by 122
Epidemics on Random Graphs with Tunable Clustering
Britton, T., Deijfen, M., Lagerås, A. N., & Lindholm, M. (2008) · Journal of Applied Probability · doi:10.1239/jap/1222441827 · Cited by 97
Controlling emerging infectious diseases like SARS
Becker, N. G., Glass, K., Li, Z., & Aldis, G. K. (2005) · Mathematical Biosciences · doi:10.1016/j.mbs.2004.07.006 · Cited by 68
Cited by
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
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
Suppressing cascades of load in interdependent networks
Brummitt, C. D., D’Souza, R. M., & Leicht, E. A. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1110586109 · Cited by 553
Metadata
- Authors
- Miller, J. C.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2009-08-04
- Volume
- 80
- Issue
- 2
- Pages
- 020901-020901
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2070963710
- Cited by
- 256
- References
- 16
- FWCI
- 9.96
- Type
- journal article
- Language
- en
- Open access
- closed
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.