Reducing Recurrent Competitive Epidemics via Dynamic Resource Allocation
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2020
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908715573051392 |
|---|---|
| author | Kalogeratos, Argyris Abel, Gaspard Mannelli, Stefano Sarao |
| author_facet | Kalogeratos, Argyris Abel, Gaspard Mannelli, Stefano Sarao |
| contents | Motivated by scenarios of epidemic competition, as well as how social contagions spread at the level of individuals, this work considers the competition between two conflicting node states that spread over a social graph according to a generic diffusion process. For this setting, we introduce the Generalized Largest Reduction in Infectious Edges (gLRIE), which is a dynamic resource allocation strategy that favors the preferred state against the other. Our analysis assumes a generic continuous-time SIS-like (Susceptible-Infectious-Susceptible) diffusion model that allows for: arbitrary node transition rate functions for nodes to change state, and competition between the healthy (positive) and infected (negative) states, which are both diffusive at the same time, yet mutually exclusive at each node. The strategy follows a minimum-risk-maximum-gain principle, and its features are particularly relevant for social contagion phenomena. In accordance with the LRIE strategy that we generalize, we show that in this context the gLRIE strategy remains a greedy solution for the minimization of the number of infected network nodes over time. Ultimately, simulations are employed to compare the proposed strategy with other existing alternatives, demonstrating that gLRIE exhibits superior performance across a spectrum of scenarios, including a realistic counter-contagion campaign in a small well-monitored community. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2006_13395 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Reducing Recurrent Competitive Epidemics via Dynamic Resource Allocation Kalogeratos, Argyris Abel, Gaspard Mannelli, Stefano Sarao Social and Information Networks Optimization and Control Physics and Society Populations and Evolution G.3; I.6; I.2.8; J.4 Motivated by scenarios of epidemic competition, as well as how social contagions spread at the level of individuals, this work considers the competition between two conflicting node states that spread over a social graph according to a generic diffusion process. For this setting, we introduce the Generalized Largest Reduction in Infectious Edges (gLRIE), which is a dynamic resource allocation strategy that favors the preferred state against the other. Our analysis assumes a generic continuous-time SIS-like (Susceptible-Infectious-Susceptible) diffusion model that allows for: arbitrary node transition rate functions for nodes to change state, and competition between the healthy (positive) and infected (negative) states, which are both diffusive at the same time, yet mutually exclusive at each node. The strategy follows a minimum-risk-maximum-gain principle, and its features are particularly relevant for social contagion phenomena. In accordance with the LRIE strategy that we generalize, we show that in this context the gLRIE strategy remains a greedy solution for the minimization of the number of infected network nodes over time. Ultimately, simulations are employed to compare the proposed strategy with other existing alternatives, demonstrating that gLRIE exhibits superior performance across a spectrum of scenarios, including a realistic counter-contagion campaign in a small well-monitored community. |
| title | Reducing Recurrent Competitive Epidemics via Dynamic Resource Allocation |
| topic | Social and Information Networks Optimization and Control Physics and Society Populations and Evolution G.3; I.6; I.2.8; J.4 |
| url | https://arxiv.org/abs/2006.13395 |