Die-out Probability in SIS Epidemic Processes on Networks

Conference paper (2017)

Authors

Q. Liu Network Architectures and Services - EEMCS
Piet Van Mieghem Network Architectures and Services - EEMCS
Research Group
Network Architectures and Services (EEMCS) (TU Delft)
More Info
expand_more

Published Date

2017

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Quantum & Computer Engineering

Research Group

Network Architectures and Services

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.

Files

Liu_Mieghem2017_Chapter_Die_ou... (pdf)
(pdf | 0.65 Mb)
Unknown license

Download not available