Die-out Probability in SIS Epidemic Processes on Networks
Abstract
An accurate approximate formula of the die-out probability in a SIS epidemic process on a network is proposed. The formula contains only three essential parameters: the largest eigenvalue of the adjacency matrix of the network, the effective infection rate of the virus, and the initial number of infected nodes in the network. The die-out probability formula is compared with the exact die-out probability in complete graphs, Erd\H{o}s-R\'enyi graphs, and a power-law graph. Furthermore, as an example, the formula is applied to the -Intertwined Mean-Field Approximation, to explicitly incorporate the die-out.
Keywords
Cite
@article{arxiv.1609.04880,
title = {Die-out Probability in SIS Epidemic Processes on Networks},
author = {Qiang Liu and Piet Van Mieghem},
journal= {arXiv preprint arXiv:1609.04880},
year = {2019}
}
Comments
Version2: 10 figures, 11 pagers. Corrected typos; simulation results of ER graphs and a power-law graph are added. Accepted by the 5th International Workshop on Complex Networks and their Applications, November 30 - December 02, 2016, Milan, Italy