Related papers: Contact processes with random recovery rates and e…
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…
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 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 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…
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 contact processes with random vertex weights on oriented lattices. In our model, we assume that each vertex x of Z^d takes i. i. d. positive random value \rho(x). Vertex y infects vertex x at rate…
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 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…
This paper is a further study of Reference \cite{Xue2015}. We are concerned with the contact process with random vertex weights on the oriented lattice. Our main result gives the asymptotic behavior of the survival probability of the…
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…
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…
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…
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…
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…
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 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 on the model of hyperbolic random graph, in the regime when the degree distribution obeys a power law with exponent $\chi \in(1,2)$ (so that the degree distribution has finite mean and infinite second…
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 construct graphs (trees of bounded degree) on which the contact process has critical rate (which will be the same for both global and local survival) equal to any prescribed value between zero and $\lambda_c(\mathbb{Z})$, the critical…
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.