Type
ArticleKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionElectrical Engineering Program
RISC Laboratory
Date
2017-07-20Online Publication Date
2017-07-20Print Publication Date
2017-09Permanent link to this record
http://hdl.handle.net/10754/626611
Metadata
Show full item recordAbstract
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 aCitation
Paarporn K, Eksin C, Weitz JS, Shamma JS (2017) Networked SIS Epidemics With Awareness. IEEE Transactions on Computational Social Systems 4: 93–103. Available: http://dx.doi.org/10.1109/tcss.2017.2719585.Sponsors
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.Additional Links
http://ieeexplore.ieee.org/document/7987055/ae974a485f413a2113503eed53cd6c53
10.1109/tcss.2017.2719585