Improved bounds on the epidemic threshold of exact SIS models on complex networks

The SIS (susceptible-infected-susceptible) epidemic model on an arbitrary network, without making approximations, is a 2n-state Markov chain with a unique absorbing state (the all-healthy state). This makes analysis of the SIS model and, in particular, determining the threshold of epidemic spread quite challenging. It has been shown that the exact marginal probabilities of infection can be upper bounded by an n-dimensional linear time-invariant system, a consequence of which is that the Markov chain is “fast-mixing” when the LTI system is stable, i.e. when equation (where β is the infection rate per link, δ is the recovery rate, and λmax(A) is the largest eigenvalue of the network's adjacency matrix). This well-known threshold has been recently shown not to be tight in several cases, such as in a star network. In this paper, we provide tighter upper bounds on the exact marginal probabilities of infection, by also taking pairwise infection probabilities into account. Based on this improved bound, we derive tighter eigenvalue conditions that guarantee fast mixing (i.e., logarithmic mixing time) of the chain. We demonstrate the improvement of the threshold condition by comparing the new bound with the known one on various networks with various epidemic parameters.

[1]  Tansu Alpcan,et al.  Network Security , 2010 .

[2]  Babak Hassibi,et al.  On the mixing time of the SIS Markov chain model for epidemic spread , 2014, 53rd IEEE Conference on Decision and Control.

[3]  Babak Hassibi,et al.  Analysis of Exact and Approximated Epidemic Models over Complex Networks , 2016, ArXiv.

[4]  Hyoung Jun Ahn Random Propagation in Complex Systems: Nonlinear Matrix Recursions and Epidemic Spread , 2014 .

[5]  Alexander Grey,et al.  The Mathematical Theory of Infectious Diseases and Its Applications , 1977 .

[6]  Moez Draief,et al.  Epidemics and Rumours in Complex Networks , 2010 .

[7]  Piet Van Mieghem,et al.  Epidemic processes in complex networks , 2014, ArXiv.

[8]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[9]  Piet Van Mieghem,et al.  An upper bound for the epidemic threshold in exact Markovian SIR and SIS epidemics on networks , 2014, 53rd IEEE Conference on Decision and Control.

[10]  J. Borge-Holthoefer,et al.  Discrete-time Markov chain approach to contact-based disease spreading in complex networks , 2009, 0907.1313.

[11]  Babak Hassibi,et al.  SIRS epidemics on complex networks: Concurrence of exact Markov chain and approximated models , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[12]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[13]  Piet Van Mieghem,et al.  Decay towards the overall-healthy state in SIS epidemics on networks , 2013, ArXiv.

[14]  Bernard Mans,et al.  Information Propagation Speed in Mobile and Delay Tolerant Networks , 2009, IEEE INFOCOM 2009.

[15]  Krishna P. Gummadi,et al.  A measurement-driven analysis of information propagation in the flickr social network , 2009, WWW '09.

[16]  Asuman E. Ozdaglar,et al.  Network Security and Contagion , 2013, PERV.

[17]  JacquetPhilippe,et al.  Information propagation speed in mobile and delay tolerant networks , 2010 .

[18]  N. Ling The Mathematical Theory of Infectious Diseases and its applications , 1978 .

[19]  George J. Pappas,et al.  Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks , 2015, IEEE Control Systems.

[20]  David K. Perry,et al.  Viral Marketing or Electronic Word-of-Mouth Advertising: Examining Consumer Responses and Motivations to Pass Along Email , 2004, Journal of Advertising Research.

[21]  Claudio Castellano,et al.  Thresholds for epidemic spreading in networks , 2010, Physical review letters.

[22]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .