Related papers: A note on the cooperative two-type SIR processes o…
We consider Susceptible-Infected-Recovered (SIR) models on dense dynamic random graphs, in which the joint dynamics of vertices and edges are co-evolutionary, i.e., they influence each other bidirectionally. In particular, edges appear and…
We study the susceptible-infected-recovered (SIR) epidemic on a random graph chosen uniformly over all graphs with certain critical, heavy-tailed degree distributions. For this model, each vertex infects all its susceptible neighbors and…
We study degree-penalized contact processes on Galton-Watson trees (GW) and the configuration model. The model we consider is a modification of the usual contact process on a graph. In particular, each vertex can be either infected or…
We study a symmetric two-disease SIR co-infection model on networks in which co-infected individuals recover at a rate distinct from that of single infections. The model explicitly represents all co-infection states and features absorbing…
In the standard SIR model, infected vertices infect their neighbors at rate $\lambda$ independently across each edge. They also recover at rate $\gamma$. In this work we consider the SIR-$\omega$ model where the graph structure itself…
We study the susceptible-infective-recovered (SIR) epidemic on a random graph chosen uniformly subject to having given vertex degrees. In this model infective vertices infect each of their susceptible neighbours, and recover, at a constant…
In this paper, we are concerned with the stochastic SIS (susceptible-infected-susceptible) and SIR (susceptible-infected-recovered) models on high-dimensional lattices with random edge weights, where a susceptible vertex is infected by an…
The susceptible-infectious-recovered (SIR) model describes the evolution of three species of individuals which are subject to an infection and recovery mechanism. A susceptible $S$ can become infectious with an infection rate $\beta$ by an…
Modeling epidemic dynamics plays an important role in studying how diseases spread, predicting their future course, and designing strategies to control them. In this letter, we introduce a model of SIR (susceptible-infected-removed) type…
This paper is concerned with the growth rate of SIR (Susceptible-Infectious-Recovered) epidemics with general infectious period distribution on random intersection graphs. This type of graph is characterized by the presence of cliques…
We are interested in the geometry of the ``infection tree'' in a stochastic SIR (Susceptible-Infectious-Recovered) model, starting with a single infectious individual. This tree is constructed by drawing an edge between two individuals when…
In this paper we are concerned with the Susceptible-Infective-Removed model with random transition rates on complete graphs $C_n$ with $n$ vertices. We assign i. i. d. copies of a positive random variable $\xi$ on each vertex as the…
In this paper we consider a model for the spread of a stochastic SIR (Susceptible $\to$ Infectious $\to$ Recovered) epidemic on a network of individuals described by a random intersection graph. Individuals belong to a random number of…
We study a discrete Susceptible-Infected-Recovered (SIR) model for the spread of infectious disease on a homogeneous tree and the limit behavior of the model in the case when the tree vertex degree tends to infinity. We obtain the…
We are interested in a variation of the SIR (Susceptible/Infected/Recovered) dynamics on the complete graph, in which infected individuals may only spread to neighboring susceptible individuals at fixed rate $\lambda>0$ while recovered…
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…
The Susceptible-Infected-Recovered (SIR) model has successfully mimicked the propagation of such airborne diseases as influenza A (H1N1). Although the SIR model has recently been studied in a multilayer networks configuration, in almost all…
The contact process, or SIS epidemic, is a continuous-time Markov process used to model the spread of infection on a graph. Each vertex is either healthy or infected, and each infected vertex independently infects each of its healthy…
The SIRS process is a continuous-time process for how infections spread on a graph. In this model, each vertex is in one of the following three states: susceptible (to the infection; S), infected (I), or recovered (R) and thus immune to the…
In this paper we are concerned with the SIR model with random vertex weights on Erd\H{o}s-R\'{e}nyi graph $G(n,p)$. The Erd\H{o}s-R\'{e}nyi graph $G(n,p)$ is generated from the complete graph $C_n$ with $n$ vertices through independently…