The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
The N-intertwined SIS epidemic network model
Open accessAbstract
Serious epidemics, both in cyber space as well as in our real world, are expected to occur with high probability, which justifies investigations in virus spread models in (contact) networks. The N -intertwined virus spread model of the SIS-type is introduced as a promising and analytically tractable model of which the steady-state behavior is fairly completely determined. Compared to the exact SIS Markov model, the N -intertwined model makes only one approximation of a mean-field kind that results in upper bounding the exact model for finite network size N and improves in accuracy with N . We review many properties theoretically, thereby showing, besides the flexibility to extend the model into an entire heterogeneous setting, that much insight can be gained that is hidden in the exact Markov model.
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
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
Dynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704 · cited 2×
“For an overview of SIS heuristics and numerous extensions, we refer to [4,21,42].”
Background
Cited by
Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
(2016) · IEEE Control Systems · doi:10.1109/mcs.2015.2495000 · Cited by 663
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
Metadata
- Authors
- Van Mieghem, P.
- Venue
- Computing
- Published
- 2011-10-13
- Volume
- 93
- Issue
- 2-4
- Pages
- 147-169
- ISSN
- 0010-485X (ISSN-L)
- 1436-5057
- OpenAlex
- W2169397725
- Cited by
- 244
- References
- 2
- FWCI
- 8.21
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: The N-intertwined SIS epidemic network model. https://app.cochat.ai/papers/10.1007/s00607-011-0155-y
- The paper
- Van Mieghem, P. (2011). The N-intertwined SIS epidemic network model. Computing. https://doi.org/10.1007/s00607-011-0155-y
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.