Related papers: SIR Epidemics on Evolving Erd\H{o}s-R\'enyi Graphs
We consider evoSIR, a variant of the SIR model, on Erd\H os-Renyi random graphs in which susceptibles with an infected neighbor break that connection at rate $\rho$ and rewire to a randomly chosen individual. We compute the critical…
The evoSIR model is a modification of the usual SIR process on a graph $G$ in which $S-I$ connections are broken at rate $\rho$ and the $S$ connects to a randomly chosen vertex. The evoSI model is the same as evoSIR but recovery is…
We investigate the SIR epidemic on a dynamic inhomogeneous Erd\H{o}s-R\'enyi random graph, in which vertices are of one of $k$ types and in which edges appear and disappear independently of each other. We establish a functional law of large…
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…
Consider an SI process on a graph $G$ where each S--I connection becomes I--I at rate $\lambda$. Here S and I stand for ``susceptible'' and ``infected'' respectively. The evoSI model is a modification of the SI model in which S--I edges are…
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 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…
A stochastic SIR (susceptible $\to$ infective $\to$ recovered) epidemic model defined on a social network is analysed. The underlying social network is described by an Erd\H{o}s-R\'{e}nyi random graph but, during the course of the epidemic,…
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…
In this paper, we study the trajectory of a classic SIR epidemic on a family of dynamic random graphs of fixed size, whose set of edges continuously evolves over time. We set general infection and recovery times, and start the epidemic from…
We study the SIR epidemic model with infections carried by $k$ particles making independent random walks on a random regular graph. Here we assume $k\leq n^{\epsilon}$, where $n$ is the number of vertices in the random graph, and $\epsilon$…
We consider an SIR-type (Susceptible $\to$ Infected $\to$ Recovered) stochastic epidemic process with multiple modes of transmission on a contact network. The network is given by a random graph following a multilayer configuration model…
We study the phase transition from the persistence phase to the extinction phase for the SIRS (susceptible/ infected/ refractory/ susceptible) model of diseases spreading on the networks. We derive an analytical expression of the…
This paper is concerned with stochastic SIR and SEIR epidemic models on random networks in which individuals may rewire away from infected neighbors at some rate $\omega$ (and reconnect to non-infectious individuals with probability…
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…
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…
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 generalization of the classical contact process (SIS epidemic model) in a directed graph $G$. Our model is a continuous-time interacting particle system in which at every time, each vertex is either healthy or infected, and each…
We consider an SIR epidemic model propagating on a configuration model network, where the degree distribution of the vertices is given and where the edges are randomly matched. The evolution of the epidemic is summed up into three…
We propose a new model that describes the dynamics of epidemic spreading on connected graphs. Our model consists in a PDE-ODE system where at each vertex of the graph we have a standard SIR model and connexions between vertices are given by…