EpiFast: a fast algorithm for large scale realistic epidemic simulations on distributed memory systems
The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
Large scale realistic epidemic simulations have recently become an increasingly important application of high-performance computing. We propose a parallel algorithm, EpiFast, based on a novel interpretation of the stochastic disease propagation in a contact network. We implement it using a master-slave computation model which allows scalability on distributed memory systems.
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 Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719 · cited 3×
“It is related to classical bond percolation [21], which helps in fast estimation, but the temporal vulnerability cannot be computed directly by bond percolation techniques.”
BackgroundMethodA contribution to the mathematical theory of epidemics
Kermack, W. O., & McKendrick, A. G. (1927) · Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character · doi:10.1098/rspa.1927.0118 · Cited by 11,701 · cited 1×
“, the classic KermackMcKendrick model [1, 14, 20]), divide the population into compartments according to people’s health state, and apply differential equations to study the evolution of epidemics in the system.”
BackgroundA Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762 · cited 1×
“More sophisticated partitioners like Metis [13] can improve the communication complexity.”
BackgroundSelf-citationPopulation biology of infectious diseases: Part I
Anderson, R. M., & May, R. M. (1979) · Nature · doi:10.1038/280361a0 · Cited by 3,185
Strategies for mitigating an influenza pandemic
Ferguson, N. M., Cummings, D. A. T., Fraser, C., Cajka, J. C., Cooley, P. C., & Burke, D. S. (2006) · Nature · doi:10.1038/nature04795 · Cited by 2,187
Modelling disease outbreaks in realistic urban social networks
Eubank, S., Guclu, H., Anil Kumar, V. S., Marathe, M. V., Srinivasan, A., Toroczkai, Z., & Wang, N. (2004) · Nature · doi:10.1038/nature02541 · Cited by 2,090 · cited 1×
“Among existing simulators, EpiFast is closely related to EpiSims [8, 9] and EpiSimdemics [3].”
MethodSelf-citationThe Mathematical Theory of Infectious Diseases and its applications
Ling, N. R. (1978) · Immunology · Cited by 1,934
Strategies for containing an emerging influenza pandemic in Southeast Asia
Ferguson, N. M., Cummings, D. A. T., Cauchemez, S., Fraser, C., Riley, S., Meeyai, A., Iamsirithaworn, S., & Burke, D. S. (2005) · Nature · doi:10.1038/nature04017 · Cited by 1,816
Mathematical Biology: I. An Introduction
(2002) · Interdisciplinary Applied Mathematics · doi:10.1007/b98868 · Cited by 1,763
(1982) · Springer eBooks · doi:10.1007/978-3-642-68635-1 · Cited by 1,361 · cited 1×
“, the classic KermackMcKendrick model [1, 14, 20]), divide the population into compartments according to people’s health state, and apply differential equations to study the evolution of epidemics in the system.”
Background
Cited by
Broeck, W. V. D., Gioannini, C., Gonçalves, B., Quaggiotto, M., Colizza, V., & Vespignani, A. (2011) · BMC Infectious Diseases · doi:10.1186/1471-2334-11-37 · Cited by 265
Metadata
- Authors
- Bisset, K. R., Chen, J., Feng, X., Kumar, V. S. A., & Marathe, M. V.
- Venue
- Proceedings of the 23rd international conference on Supercomputing
- Publisher
- ACM
- Published
- 2009-06-08
- Pages
- 430-439
- OpenAlex
- W2061370256
- Cited by
- 174
- References
- 22
- FWCI
- 91.92
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: EpiFast: a fast algorithm for large scale realistic epidemic simulations on distributed memory systems. https://app.cochat.ai/papers/10.1145/1542275.1542336
- The paper
- Bisset, K. R., Chen, J., Feng, X., Kumar, V. S. A., & Marathe, M. V. (2009). EpiFast: a fast algorithm for large scale realistic epidemic simulations on distributed memory systems. Proceedings of the 23rd international conference on Supercomputing. https://doi.org/10.1145/1542275.1542336
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.