TY - JOUR
T1 - Networked SIS Epidemics with Awareness
AU - Paarporn, Keith
AU - Eksin, Ceyhun
AU - Weitz, Joshua S.
AU - Shamma, Jeff S.
N1 - Manuscript received July 2, 2016; revised May 25, 2017; accepted June 11, 2017. Date of publication July 20, 2017; date of current version August 28, 2017. This work was supported in part by the Army Research Office under Grant W911NF-14-1-0402, and in part by the King Abdullah University of Science and Technology. (Corresponding author: Keith Paarporn.) K. Paarporn is with the School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332 USA (e-mail: [email protected]).
PY - 2017/9
Y1 - 2017/9
N2 - We study a susceptible-infected-susceptible epidemic process over a static contact network where the nodes have partial information about the epidemic state. They react by limiting their interactions with their neighbors when they believe the epidemic is currently prevalent. A node's awareness is weighted by the fraction of infected neighbors in their social network, and a global broadcast of the fraction of infected nodes in the entire network. The dynamics of the benchmark (no awareness) and awareness models are described by discrete-time Markov chains, from which mean-field approximations (MFAs) are derived. The states of the MFA are interpreted as the nodes' probabilities of being infected. We show a sufficient condition for the existence of a 'metastable,' or endemic, state of the awareness model coincides with that of the benchmark model. Furthermore, we use a coupling technique to give a full stochastic comparison analysis between the two chains, which serves as a probabilistic analog to the MFA analysis. In particular, we show that adding awareness reduces the expectation of any epidemic metric on the space of sample paths, e.g., eradication time or total infections. We characterize the reduction in expectations in terms of the coupling distribution. In simulations, we evaluate the effect social distancing has on contact networks from different random graph families (geometric, Erds-Rényi, and scale-free random networks).
AB - We study a susceptible-infected-susceptible epidemic process over a static contact network where the nodes have partial information about the epidemic state. They react by limiting their interactions with their neighbors when they believe the epidemic is currently prevalent. A node's awareness is weighted by the fraction of infected neighbors in their social network, and a global broadcast of the fraction of infected nodes in the entire network. The dynamics of the benchmark (no awareness) and awareness models are described by discrete-time Markov chains, from which mean-field approximations (MFAs) are derived. The states of the MFA are interpreted as the nodes' probabilities of being infected. We show a sufficient condition for the existence of a 'metastable,' or endemic, state of the awareness model coincides with that of the benchmark model. Furthermore, we use a coupling technique to give a full stochastic comparison analysis between the two chains, which serves as a probabilistic analog to the MFA analysis. In particular, we show that adding awareness reduces the expectation of any epidemic metric on the space of sample paths, e.g., eradication time or total infections. We characterize the reduction in expectations in terms of the coupling distribution. In simulations, we evaluate the effect social distancing has on contact networks from different random graph families (geometric, Erds-Rényi, and scale-free random networks).
KW - Epidemics
KW - Markov processes
KW - networks
KW - stochastic processes
UR - http://www.scopus.com/inward/record.url?scp=85028911210&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028911210&partnerID=8YFLogxK
U2 - 10.1109/TCSS.2017.2719585
DO - 10.1109/TCSS.2017.2719585
M3 - Article
AN - SCOPUS:85028911210
SN - 2329-924X
VL - 4
SP - 93
EP - 103
JO - IEEE Transactions on Computational Social Systems
JF - IEEE Transactions on Computational Social Systems
IS - 3
M1 - 7987055
ER -