Related papers: The contact process seen from a typical infected s…
This paper gives a new, simple proof of the known fact that for contact processes on general lattices, in the subcritical regime the expected number of infected sites decays exponentially fast as time tends to infinity. The proof also…
The contact process is a particular case of birth-and-death processes on infinite particle configurations. We consider the contact models on locally compact separable metric spaces. We prove the existence of a one-parameter set of invariant…
We consider a random walk on top of the contact process on $\mathbb{Z}^d$ with $d\geq 1$. In particular, we focus on the "contact process as seen from the random walk". Under the assumption that the infection rate of the contact process is…
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…
In this paper we study the metastability of the contact process on a random regular graph. We show that the extinction time of the contact process, when initialized so that all vertices are infected at time 0, grows exponentially with the…
We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the…
What is the long-time behavior of the law of a contact process started with a single infected site, distributed according to counting measure on the lattice? This question is related to the configuration as seen from a typical infected site…
We study a one-dimensional contact process with two infection parameters, one giving the infection rates at the boundaries of a finite infected region and the other one the rates within that region. We prove that the critical value of each…
We study a contact process running in a random environment in $\mathbb {Z}^d$ where sites flip, independently of each other, between blocking and nonblocking states, and the contact process is restricted to live in the space given by…
Bezuidenhout and Grimmett proved that the critical contact process dies out. Here, we generalize the result to the so called contact process in a random evolving environment (CPREE), introduced by Erik Broman. This process is a…
The one-dimensional contact process is analyzed by a cluster approximation. In this approach, the hierarchy of rate equations for the densities of finite length empty intervals are truncated under the assumption that adjacent intervals are…
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,…
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 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,…
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…
In this paper we are concerned with the contact process on the squared lattice. The contact process intuitively describes the spread of the infectious disease on a graph, where an infectious vertex becomes healthy at a constant rate while a…
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 study the contact process on a class of geometric random graphs with scale-free degree distribution, defined on a Poisson point process on $\mathbb{R}^d$. This class includes the age-dependent random connection model and the soft Boolean…
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…
We consider a supercritical branching process and define a contact tracing mechanism on its genealogical tree. We calculate the growth rate of the post tracing process, and give conditions under which the tracing is strong enough to drive…