z-logo
open-access-imgOpen Access
Optimal information dissemination strategy to promote preventivebehaviors in multilayer epidemic networks
Author(s) -
Heman Shakeri,
Faryad Darabi Sahneh,
Caterina Scoglio,
Pietro PoggiCorradini,
Víctor M. Preciado
Publication year - 2015
Publication title -
mathematical biosciences and engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.451
H-Index - 45
eISSN - 1551-0018
pISSN - 1547-1063
DOI - 10.3934/mbe.2015.12.609
Subject(s) - constraint (computer aided design) , computer science , transmission (telecommunications) , dissemination , computer network , mathematical optimization , engineering , telecommunications , mathematics , mechanical engineering
Launching a prevention campaign to contain the spread of infection requires substantial financial investments; therefore, a trade-off exists between suppressing the epidemic and containing costs. Information exchange among individuals can occur as physical contacts (e.g., word of mouth, gatherings), which provide inherent possibilities of disease transmission, and non-physical contacts (e.g., email, social networks), through which information can be transmitted but the infection cannot be transmitted. Contact network (CN) incorporates physical contacts, and the information dissemination network (IDN) represents non-physical contacts, thereby generating a multilayer network structure. Inherent differences between these two layers cause alerting through CN to be more effective but more expensive than IDN. The constraint for an epidemic to die out derived from a nonlinear Perron-Frobenius problem that was transformed into a semi-definite matrix inequality and served as a constraint for a convex optimization problem. This method guarantees a dying-out epidemic by choosing the best nodes for adopting preventive behaviors with minimum monetary resources. Various numerical simulations with network models and a real-world social network validate our method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here