Related papers: Contact process on a graph with communities
We study the contact process on random graphs with low infection rate $\lambda$. For random $d$-regular graphs, it is known that the survival time is $O(\log n)$ below the critical $\lambda_c$. By contrast, on the Erd\H{o}s-R\'enyi random…
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…
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…
We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R{\'e}nyi graphs with mean degree large enough survives a time exponential in the size of these graphs for any positive infection rate. In addition, a…
We study the contact process on the complete graph on $n$ vertices where the rate at which the infection travels along the edge connecting vertices $i$ and $j$ is equal to $ \lambda w_i w_j / n$ for some $\lambda >0$, where $w_i$ are i.i.d.…
We consider the contact process on a dynamic graph defined as a random $d$-regular graph with a stationary edge-switching dynamics. In this graph dynamics, independently of the contact process state, each pair $\{e_1,e_2\}$ of edges of the…
We study the contact process on a dynamic random~$d$-regular graph with an edge-switching mechanism, as well as an interacting particle system that arises from the local description of this process, called the herds process. Both these…
We introduce a model of epidemics among moving particles on any locally finite graph. At any time, each vertex is empty, occupied by a healthy particle, or occupied by an infected particle. Infected particles recover at rate $1$ and…
We introduce a method to prove metastability of the contact process on Erd\H{o}s-R\'enyi graphs and on configuration model graphs. The method relies on uniformly bounding the total infection rate from below, over all sets with a fixed…
We consider the contact process with infection rate $\lambda$ on a random $(d+1)$-regular graph with $n$ vertices, $G_n$. We study the extinction time $\tau_{G_n}$ (that is, the random amount of time until the infection disappears) as $n$…
The history of infections and epidemics holds famous examples where understanding, containing and ultimately treating an outbreak began with understanding its mode of spread. Influenza, HIV and most computer viruses, spread person to…
We address the question of understanding the effect of the underlying network topology on the spread of a virus and the dissemination of information when users are mobile performing independent random walks on a graph. To this end we…
Infectious disease remains, despite centuries of work to control and mitigate its effects, a major problem facing humanity. This paper reviews the mathematical modelling of infectious disease epidemics on networks, starting from the…
Graph-theoretic methods have seen wide use throughout the literature on multi-agent control and optimization. When communications are intermittent and unpredictable, such networks have been modeled using random communication graphs. When…
We show existence of a non-trivial phase transition for the contact process, a simple model for infection without immunity, on a network which reacts dynamically to the infection trying to prevent an epidemic. This network initially has the…
In this paper, we prove lower and upper bounds for the extinction time of the contact process on random geometric graphs with connecting radius tending to infinity. We obtain that for any infection rate $\lambda >0$, the contact process on…
Drug resistance and strong contacts actually play crucial roles in epidemic spread in complex systems. Nevertheless, neither theoretical model or methodology is proposed to address this. We thus consider an edge-based epidemic spread model…
We show that the contact process on a random $d$-regular graph initiated by a single infected vertex obeys the "cutoff phenomenon" in its supercritical phase. In particular, we prove that when the infection rate is larger than the critical…
This paper is concerned with contact process with random vertex weights on regular trees, and study the asymptotic behavior of the critical infection rate as the degree of the trees increasing to infinity. In this model, the infection…
We consider the contact process on the preferential attachment graph. The work of Berger, Borgs, Chayes and Saberi [BBCS1] confirmed physicists predictions that the contact process starting from a typical vertex becomes endemic for an…