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ő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.

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

References in corpus (1)

• Sampling methods for the quasistationary regime of epidemic processes on regular and complex networks

Cited by in corpus (3)

• Network localization is unalterable by infections in bursts
• Universality of the SIS prevalence in networks
• Influence of individual nodes for continuous-time Susceptible-Infected-Susceptible dynamics on synthetic and real-world networks