Show simple item record

dc.contributor.authorRuhi, Navid Azizan
dc.contributor.authorThrampoulidis, Christos
dc.contributor.authorHassibi, Babak
dc.date.accessioned2017-05-15T10:35:08Z
dc.date.available2017-05-15T10:35:08Z
dc.date.issued2017-01-05
dc.identifier.citationRuhi NA, Thrampoulidis C, Hassibi B (2016) Improved bounds on the epidemic threshold of exact SIS models on complex networks. 2016 IEEE 55th Conference on Decision and Control (CDC). Available: http://dx.doi.org/10.1109/cdc.2016.7798804.
dc.identifier.doi10.1109/cdc.2016.7798804
dc.identifier.urihttp://hdl.handle.net/10754/623556
dc.description.abstractThe 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.
dc.description.sponsorshipThis work was supported in part by the National Science Foundation under grants CNS-0932428, CCF-1018927, CCF-1423663 and CCF-1409204, by a grant from Qualcomm Inc., by NASAs Jet Propulsion Laboratory through the President and Directors Fund, by King Abdulaziz University, and by King Abdullah University of Science and Technology.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.titleImproved bounds on the epidemic threshold of exact SIS models on complex networks
dc.typeConference Paper
dc.identifier.journal2016 IEEE 55th Conference on Decision and Control (CDC)
dc.conference.date2016-12-12 to 2016-12-14
dc.conference.name55th IEEE Conference on Decision and Control, CDC 2016
dc.conference.locationLas Vegas, NV, USA
dc.contributor.institutionCalifornia Institute of Technology, Pasadena, CA 91125, USA


This item appears in the following Collection(s)

Show simple item record