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ȍs-Rényi graphs, and a power-law graph. Furthermore, as an example, the formula is applied to the N-Intertwined Mean-Field Approximation, to explicitly incorporate the die-out.
CITATION STYLE
Liu, Q., & Van Mieghem, P. (2017). Die-out probability in SIS epidemic processes on networks. Studies in Computational Intelligence, 693, 511–521. https://doi.org/10.1007/978-3-319-50901-3_41
Mendeley helps you to discover research relevant for your work.