Networked SIS Epidemics With Awareness

Keith Paarporn; Ceyhun Eksin; Joshua S. Weitz; Jeff S. Shamma

doi:10.1109/tcss.2017.2719585

Networked SIS Epidemics With Awareness

Keith Paarporn, Ceyhun Eksin, Joshua S. Weitz, Jeff S. Shamma

Research output: Contribution to journal › Article › peer-review

39 Scopus citations

Abstract

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

Original language	English (US)
Pages (from-to)	93-103
Number of pages	11
Journal	IEEE Transactions on Computational Social Systems
Volume	4
Issue number	3
DOIs	https://doi.org/10.1109/tcss.2017.2719585
State	Published - Jul 20 2017

Access to Document

10.1109/tcss.2017.2719585

Cite this

@article{6b0693ce90d4484ba322cab035e89f5d,

title = "Networked SIS Epidemics With Awareness",

abstract = "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",

author = "Keith Paarporn and Ceyhun Eksin and Weitz, {Joshua S.} and Shamma, {Jeff S.}",

note = "KAUST Repository Item: Exported on 2020-10-01 Acknowledgements: 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.",

year = "2017",

month = jul,

day = "20",

doi = "10.1109/tcss.2017.2719585",

language = "English (US)",

volume = "4",

pages = "93--103",

journal = "IEEE Transactions on Computational Social Systems",

issn = "2329-924X",

publisher = "IEEE Systems, Man, and Cybernetics Society",

number = "3",

}

TY - JOUR

T1 - Networked SIS Epidemics With Awareness

AU - Paarporn, Keith

AU - Eksin, Ceyhun

AU - Weitz, Joshua S.

AU - Shamma, Jeff S.

N1 - KAUST Repository Item: Exported on 2020-10-01 Acknowledgements: 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.

PY - 2017/7/20

Y1 - 2017/7/20

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

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

UR - http://hdl.handle.net/10754/626611

UR - http://ieeexplore.ieee.org/document/7987055/

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

U2 - 10.1109/tcss.2017.2719585

DO - 10.1109/tcss.2017.2719585

M3 - Article

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

ER -

Networked SIS Epidemics With Awareness

Abstract

Access to Document

Other files and links

Fingerprint

Cite this