FastSIR algorithm: a fast algorithm for the simulation of the epidemic spread in large networks by using the susceptible-infected-recovered compartment model
DOI10.1016/j.ins.2013.03.036zbMath1320.68033arXiv1202.1639OpenAlexW1712233013MaRDI QIDQ497122
Nino Antulov-Fantulin, Alen Lančić, Hrvoje Štefančić, Mile Šikić
Publication date: 23 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.1639
Epidemiology (92D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- FastSIR algorithm: a fast algorithm for the simulation of the epidemic spread in large networks by using the susceptible-infected-recovered compartment model
- The modeling of global epidemics: stochastic dynamics and predictability
- On the critical behavior of the general epidemic process and dynamical percolation
- Predicting epidemics on directed contact networks
- The Mathematics of Infectious Diseases
- From the Cover: The structure of scientific collaboration networks
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Faster methods for random sampling
- The Structure and Function of Complex Networks
- Collective dynamics of ‘small-world’ networks
This page was built for publication: FastSIR algorithm: a fast algorithm for the simulation of the epidemic spread in large networks by using the susceptible-infected-recovered compartment model