Related papers: Contact Process under heavy-tailed renewals on fin…
Motivated by questions regarding long range percolation, we investigate a non-Markovian analogue of the Harris contact process in $\mathbb{Z}^d$: an individual is attached to each site $x \in \mathbb{Z}^d$, and it can be infected or…
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 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 renewal contact process is a non-Markovian variant of the classical contact process in which recoveries are governed by independent renewal processes with interarrival distribution $\mu$. We establish new sufficient conditions ensuring…
The renewal contact process, introduced in $2019$ by Fontes, Marchetti, Mountford, and Vares, extends the Harris contact process in $\mathbb{Z}^d$ by allowing the possible cure times to be determined according to independent renewal…
We study one specific version of the contact process on a graph. Here, we allow multiple infections carried by the nodes and include a probability of removing nodes in a graph. The removal probability is purely determined by the number of…
We consider the contact process with dormancy, where wake-up times follow a renewal process. Without infection between dormant individuals, we show that the process under certain conditions grows at most logarithmically. On the other hand,…
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 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 are interested in the spread of an epidemic between two communities that have higher connectivity within than between them. We model the two communities as independent Erdos-Renyi random graphs, each with n vertices and edge probability…
We refine previous results concerning the Renewal Contact Processes. We significantly widen the family of distributions for the interarrival times for which the critical value can be shown to be strictly positive. The result now holds for…
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 consider contact processes on the hierarchical group, where sites infect other sites at a rate depending on their hierarchical distance, and sites become healthy with a constant recovery rate. If the infection rates decay too fast as 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 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$…
We consider the contact process on finite and connected graphs and study the behavior of the extinction time, that is, the amount of time that it takes for the infection to disappear in the process started from full occupancy. We prove,…
In the multitype contact process, vertices of a graph can be empty or occupied by a type 1 or a type 2 individual; an individual of type $i$ dies with rate 1 and sends a descendant to a neighboring empty site with rate $\lambda_i$. We study…
We present general results for the contact process by a method which applies to all transitive graphs of bounded degree, including graphs of exponential growth. The model's infection rates are varied through a control parameter, for which…
Propagation of contagion in networks depends on the graph topology. This paper is concerned with studying the time-asymptotic behavior of the extended contact processes on static, undirected, finite-size networks. This is a contact process…