期刊
INFORMATION SCIENCES
卷 239, 期 -, 页码 226-240出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2013.03.036
关键词
SIR compartment model; Epidemic spreading algorithm; Computational epidemiology
资金
- Ministry of Education Science and Sports of the Republic of Croatia [036-0362214-1987, 098-1191344-2860, 098-0352828-2863]
- BMRC of A*STAR, Republic of Singapore
We propose two efficient epidemic spreading algorithms (Naive SIR and FastSIR) for arbitrary network structures, based on the SIR (susceptible-infected-recovered) compartment model. The Naive SIR algorithm models full epidemic dynamics of the well-known SIR model and uses data structures efficiently to reduce running time. The FastSIR algorithm is based on the probability distribution over the number of infected nodes and uses the concept of generation time instead of explicit time in treating the spreading dynamics. Furthermore, we also propose an efficient recursive method for calculating probability distributions of the number of infected nodes. The average case running time of both algorithms has also been derived and an experimental analysis was made on five different empirical complex networks. (C) 2013 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据