Related papers: SIR on locally converging dynamic random graphs
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…
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 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…
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 study a simple model of epidemics where an infected node transmits the infection to its neighbors independently with probability $p$. This is also known as the independent cascade or Susceptible-Infected-Recovered (SIR) model with fixed…
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…
Emergence of new diseases and elimination of existing diseases is a key public health issue. In mathematical models of epidemics, such phenomena involve the process of infections and recoveries passing through a critical threshold where the…
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 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…
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…
Most epidemic models assume equal mixing among members of a population. An alternative approach is to model a population as random network in which individuals may have heterogeneous connectivity. This paper builds on previous research by…
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…
The study of social networks, and in particular the spread of disease on networks, has attracted considerable recent attention in the physics community. In this paper, we show that a large class of standard epidemiological models, the…
In this paper, we are concerned with SIR epidemics in a random environment on complete graphs, where every edges are assigned with i.i.d. weights. Our main results give large and moderate deviation principles of sample paths of this model.
We propose an extension of the classical susceptible infectious recovered (SIR) model that incorporates the effects of spatial propagation of an epidemic through a small number of additional compartments. The model is designed to capture…
We focus on an epidemiological model (the archetypical SIR system) defined on graphs and study the asymptotic behavior of the solutions as the number of vertices in the graph diverges. By relying on the theory of so called graphons we…
In this paper we consider SIR epidemics on random graphs with clustering. To incorporate group structure of the underlying social network, we use a generalized version of the configuration model in which each node is a member of a specified…
In this paper we study the susceptible-infectious (SI) epidemiological model using dynamical graphs. Dynamical structures have been recently applied in many areas including complex systems. Dynamical structures include the mutual…
In this work, we use a new approach to study the spread of an infectious disease. Indeed, we study a SIR epidemic model with variable infectivity, where the individuals are distributed over a compact subset $D$ of $\R^d$. We define…