Die-out Probability in SIS Epidemic Processes on Networks

Qiang Liu; Piet Van Mieghem

doi:10.1007/978-3-319-50901-3_41

Die-out Probability in SIS Epidemic Processes on Networks

^*Corresponding author for this work

Network Architectures and Services

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

6 Citations (Scopus)

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.

Original language	English
Title of host publication	Complex Networks and their Applications V
Subtitle of host publication	Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016)
Editors	H. Cherifi, S. Gaito, W. Quattrociocchi, A. Sala
Place of Publication	Cham
Publisher	Springer
Pages	511-521
Number of pages	11
ISBN (Electronic)	978-3-319-50901-3
DOIs	https://doi.org/10.1007/978-3-319-50901-3_41
Publication status	Published - 2017
Event	5th International Workshop on Complex Networks and their Applications: 5th International Workshop on Complex Networks and their Applications - Milan, Italy Duration: 30 Nov 2016 → 2 Dec 2016 Conference number: 5 http://complexnetworks.org/index2016.html http://complexnetworks.org/index2016.html

Publication series

Name	Studies in Computational Intelligence
Volume	693
ISSN (Print)	1860-949X

Conference

Conference	5th International Workshop on Complex Networks and their Applications
Country/Territory	Italy
City	Milan
Period	30/11/16 → 2/12/16
Internet address	http://complexnetworks.org/index2016.html http://complexnetworks.org/index2016.html

Access to Document

10.1007/978-3-319-50901-3_41

Cite this

Liu, Q., & Van Mieghem, P. (2017). Die-out Probability in SIS Epidemic Processes on Networks. In H. Cherifi, S. Gaito, W. Quattrociocchi, & A. Sala (Eds.), Complex Networks and their Applications V: Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016) (pp. 511-521). (Studies in Computational Intelligence; Vol. 693). Springer. https://doi.org/10.1007/978-3-319-50901-3_41

Liu, Qiang ; Van Mieghem, Piet. / Die-out Probability in SIS Epidemic Processes on Networks. Complex Networks and their Applications V: Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016). editor / H. Cherifi ; S. Gaito ; W. Quattrociocchi ; A. Sala. Cham : Springer, 2017. pp. 511-521 (Studies in Computational Intelligence).

@inproceedings{0085cbedbf7e4d61aa802d354e74435f,

title = "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{\'e}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.",

author = "Qiang Liu and {Van Mieghem}, Piet",

year = "2017",

doi = "10.1007/978-3-319-50901-3_41",

language = "English",

series = "Studies in Computational Intelligence",

publisher = "Springer",

pages = "511--521",

editor = "H. Cherifi and S. Gaito and W. Quattrociocchi and A. Sala",

booktitle = "Complex Networks and their Applications V",

note = "5th International Workshop on Complex Networks and their Applications : 5th International Workshop on Complex Networks and their Applications ; Conference date: 30-11-2016 Through 02-12-2016",

url = "http://complexnetworks.org/index2016.html, http://complexnetworks.org/index2016.html",

}

Liu, Q & Van Mieghem, P 2017, Die-out Probability in SIS Epidemic Processes on Networks. in H Cherifi, S Gaito, W Quattrociocchi & A Sala (eds), Complex Networks and their Applications V: Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016). Studies in Computational Intelligence, vol. 693, Springer, Cham, pp. 511-521, 5th International Workshop on Complex Networks and their Applications, Milan, Italy, 30/11/16. https://doi.org/10.1007/978-3-319-50901-3_41

Die-out Probability in SIS Epidemic Processes on Networks. / Liu, Qiang; Van Mieghem, Piet.
Complex Networks and their Applications V: Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016). ed. / H. Cherifi; S. Gaito; W. Quattrociocchi; A. Sala. Cham: Springer, 2017. p. 511-521 (Studies in Computational Intelligence; Vol. 693).

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Die-out Probability in SIS Epidemic Processes on Networks

AU - Liu, Qiang

AU - Van Mieghem, Piet

N1 - Conference code: 5

PY - 2017

Y1 - 2017

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

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

UR - http://www.scopus.com/inward/record.url?scp=85007335655&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-50901-3_41

DO - 10.1007/978-3-319-50901-3_41

M3 - Conference contribution

AN - SCOPUS:85007335655

T3 - Studies in Computational Intelligence

SP - 511

EP - 521

BT - Complex Networks and their Applications V

A2 - Cherifi, H.

A2 - Gaito, S.

A2 - Quattrociocchi, W.

A2 - Sala, A.

PB - Springer

CY - Cham

T2 - 5th International Workshop on Complex Networks and their Applications

Y2 - 30 November 2016 through 2 December 2016

ER -

Liu Q, Van Mieghem P. Die-out Probability in SIS Epidemic Processes on Networks. In Cherifi H, Gaito S, Quattrociocchi W, Sala A, editors, Complex Networks and their Applications V: Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016). Cham: Springer. 2017. p. 511-521. (Studies in Computational Intelligence). doi: 10.1007/978-3-319-50901-3_41

Die-out Probability in SIS Epidemic Processes on Networks

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Spreading on Networks

Cite this