Non-Markovian Infection Spread Dramatically Alters the Susceptible-Infected-Susceptible Epidemic Threshold in Networks
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Most studies on susceptible-infected-susceptible epidemics in networks implicitly assume Markovian behavior: the time to infect a direct neighbor is exponentially distributed. Much effort so far has been devoted to characterize and precisely compute the epidemic threshold in susceptible-infected-susceptible Markovian epidemics on networks. Here, we report the rather dramatic effect of a nonexponential infection time (while still assuming an exponential curing time) on the epidemic threshold by considering Weibullean infection times with the same mean, but different power exponent α. For three basic classes of graphs, the Erdős-Rényi random graph, scale-free graphs and lattices, the average steady-state fraction of infected nodes is simulated from which the epidemic threshold is deduced. For all graph classes, the epidemic threshold significantly increases with the power exponents α. Hence, real epidemics that violate the exponential or Markovian assumption can behave seriously differently than anticipated based on Markov theory.
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
The Largest Eigenvalue of Sparse Random Graphs
KRIVELEVICH, M., & SUDAKOV, B. (2003) · Combinatorics, Probability and Computing · doi:10.1017/s0963548302005424 · Cited by 207
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
Unification of theoretical approaches for epidemic spreading on complex networks
Wang, W., Tang, M., Eugene Stanley, H., & Braunstein, L. A. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa5398 · Cited by 366
Analytical Computation of the Epidemic Threshold on Temporal Networks
Valdano, E., Ferreri, L., Poletto, C., & Colizza, V. (2015) · Physical Review X · doi:10.1103/physrevx.5.021005 · Cited by 187
Macroscopic patterns of interacting contagions are indistinguishable from social reinforcement
Hébert-Dufresne, L., Scarpino, S. V., & Young, J.-G. (2020) · Nature Physics · doi:10.1038/s41567-020-0791-2 · Cited by 71
A new buffering theory of social support and psychological stress
Bekiros, S., Jahanshahi, H., & Munoz-Pacheco, J. M. (2022) · PLOS ONE · doi:10.1371/journal.pone.0275364 · Cited by 54
Metadata
- Authors
- Van Mieghem, P., & van de Bovenkamp, R.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2013-03-05
- Volume
- 110
- Issue
- 10
- Pages
- 108701-108701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2000940858
- Cited by
- 190
- References
- 1
- FWCI
- 11.72
- 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.