Competitive epidemic networks with multiple survival-of-the-fittest outcomes
We use a deterministic model to study two competing viruses spreading over a two-layer network in the Susceptible--Infected--Susceptible (SIS) framework, and address a central problem of identifying the winning virus in a "survival-of-the-fittest" battle. Existing sufficient conditions ensure that the same virus always wins regardless of initial states. For networks with an arbitrary but finite number of nodes, there exists a necessary and sufficient condition that guarantees local exponential stability of the two equilibria corresponding to each virus winning the battle, meaning that either of the viruses can win, depending on the initial states. However, establishing existence and finding examples of networks with more than three nodes that satisfy such a condition has remained unaddressed. In this paper, we prove that, for any arbitrary number of nodes, such networks exist. We do this by proving that given almost any network layer of one virus, there exists a network layer for the other virus such that the resulting two-layer network satisfies the aforementioned condition. To operationalize our findings, a four-step procedure is developed to reliably and consistently design one of the network layers, when given the other layer. Conclusions from numerical case studies, including a real-world mobility network that captures the commuting patterns for people between $107$ provinces in Italy, extend on the theoretical result and its consequences..
| Medienart: |
|
|---|
Preprint| Erscheinungsjahr: |
2021 |
|---|---|
| Erschienen: |
2021 |
| Enthalten in: |
arXiv.org - (2021) vom: 11. Nov. Zur Gesamtaufnahme - year:2021 |
|---|
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Ye, Mengbin [VerfasserIn] |
|---|
| Links: |
Volltext [kostenfrei] |
|---|
| Themen: |
000 |
|---|
| Förderinstitution / Projekttitel: |
|
|---|
| PPN (Katalog-ID): |
XAR033011524 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | XAR033011524 | ||
| 003 | DE-627 | ||
| 005 | 20230429070218.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 211115s2021 xx |||||o 00| ||eng c | ||
| 035 | |a (DE-627)XAR033011524 | ||
| 035 | |a (arXiv)2111.06538 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Ye, Mengbin |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Competitive epidemic networks with multiple survival-of-the-fittest outcomes |
| 264 | 1 | |c 2021 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a We use a deterministic model to study two competing viruses spreading over a two-layer network in the Susceptible--Infected--Susceptible (SIS) framework, and address a central problem of identifying the winning virus in a "survival-of-the-fittest" battle. Existing sufficient conditions ensure that the same virus always wins regardless of initial states. For networks with an arbitrary but finite number of nodes, there exists a necessary and sufficient condition that guarantees local exponential stability of the two equilibria corresponding to each virus winning the battle, meaning that either of the viruses can win, depending on the initial states. However, establishing existence and finding examples of networks with more than three nodes that satisfy such a condition has remained unaddressed. In this paper, we prove that, for any arbitrary number of nodes, such networks exist. We do this by proving that given almost any network layer of one virus, there exists a network layer for the other virus such that the resulting two-layer network satisfies the aforementioned condition. To operationalize our findings, a four-step procedure is developed to reliably and consistently design one of the network layers, when given the other layer. Conclusions from numerical case studies, including a real-world mobility network that captures the commuting patterns for people between $107$ provinces in Italy, extend on the theoretical result and its consequences. | ||
| 650 | 4 | |a Mathematics - Dynamical Systems |7 (dpeaa)DE-84 | |
| 650 | 4 | |a Computer Science - Systems and Control |7 (dpeaa)DE-84 | |
| 650 | 4 | |a Electrical Engineering and Systems Science - Systems and Control |7 (dpeaa)DE-84 | |
| 650 | 4 | |a 510 |7 (dpeaa)DE-84 | |
| 650 | 4 | |a 000 |7 (dpeaa)DE-84 | |
| 650 | 4 | |a 620 |7 (dpeaa)DE-84 | |
| 700 | 1 | |a Anderson, Brian D. O. |e verfasserin |4 aut | |
| 700 | 1 | |a Janson, Axel |e verfasserin |4 aut | |
| 700 | 1 | |a Gracy, Sebin |e verfasserin |4 aut | |
| 700 | 1 | |a Johansson, Karl H. |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t arXiv.org |g (2021) vom: 11. Nov. |
| 773 | 1 | 8 | |g year:2021 |g day:11 |g month:11 |
| 856 | 4 | 0 | |u https://arxiv.org/abs/2111.06538 |z kostenfrei |3 Volltext |
| 912 | |a GBV_XAR | ||
| 912 | |a SSG-OLC-PHA | ||
| 951 | |a AR | ||
| 952 | |j 2021 |b 11 |c 11 | ||