Bi-SIS Epidemics on Graphs -- Quantitative Analysis of Coexistence Equilibria
We consider a system in which two viruses of the Susceptible-Infected-Susceptible (SIS) type compete over general, overlaid graphs. While such systems have been the focus of many recent works, they have mostly been studied in the sense of convergence analysis, with no existing results quantifying the non-trivial coexistence equilibria (CE) - that is, when both competing viruses maintain long term presence over the network. In this paper, we prove monotonicity of the CE with respect to effective infection rates of the two viruses, and provide the first quantitative analysis of such equilibria in the form of upper bounds involving spectral radii of the underlying graphs, as well as positive equilibria of related single-virus systems. Our results provide deeper insight into how the long term infection probabilities are affected by system parameters, which we further highlight via numerical results.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Competing Epidemics on Graphs -- Global Convergence and Coexistence
The dynamics of the spread of contagions such as viruses, infectious diseases or even rumors/opinions over contact networks (graphs) have effectively been captured by the well known \textit{Susceptible-Infected-Susceptib…
Convergence of Bi-Virus Epidemic Models with Non-Linear Rates on Networks -- A Monotone Dynamical Systems Approach
We study convergence properties of competing epidemic models of the Susceptible-Infected-Susceptible (SIS) type. The SIS epidemic model has seen widespread popularity in modelling the spreading dynamics of contagions suc…
Towards Understanding the Endemic Behavior of a Competitive Tri-Virus SIS Networked Model
This paper studies the endemic behavior of a multi-competitive networked susceptible-infected-susceptible (SIS) model. Specifically, the paper deals with three competing virus systems (i.e., tri-virus systems). First, we…
Competitive Networked Bivirus SIS spread over Hypergraphs
The paper deals with the spread of two competing viruses over a network of population nodes, accounting for pairwise interactions and higher-order interactions (HOI) within and between the population nodes. We study the …
Hypergraphon Mean Field Games
We propose an approach to modelling large-scale multi-agent dynamical systems allowing interactions among more than just pairs of agents using the theory of mean field games and the notion of hypergraphons, which are obt…