Related papers: Graph constructions for the contact process with 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 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 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…

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…

A little over 25 years ago Pemantle pioneered the study of the contact process on trees, and showed that the critical values $\lambda_1$ and $\lambda_2$ for global and local survival were different. Here, we will consider the case of trees…

A little over 25 years ago Pemantle pioneered the study of the contact process on trees, and showed that on homogeneous trees the critical values $\lambda_1$ and $\lambda_2$ for global and local survival were different. He also considered…

If we consider the contact process with infection rate $\lambda$ on a random graph on $n$ vertices with power law degree distributions, mean field calculations suggest that the critical value $\lambda_c$ of the infection rate is positive if…

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…

The regular tree corresponds to the random regular graph as its local limit. For this reason the famous double phase transition of the contact process on regular tree has been seen to correspond to a phase transition on the large random…

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…

In this paper we are concerned with the contact process with random recovery rates and edge weights on complete graph with $n$ vertices. We show that the model has a critical value which is inversely proportional to the product of the mean…

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 note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…

In this paper we are concerned with contact processes with random edge weights on rooted regular trees. We assign i.i.d weights on each edge on the tree and assume that an infected vertex infects its healthy neighbor at rate proportional to…

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 show that the critical value for the contact process on a vertex-transitive graph G with finitely many edges added and/or removed is the same as the critical value for the contact process on G.

We study the extinction time $\uptau$ of the contact process on finite trees of bounded degree. We show that, if the infection rate is larger than the critical rate for the contact process on $\Z$, then, uniformly over all trees of degree…

We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We…

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$…

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…