Related papers: The survival probability of the high-dimensional c…
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…
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…
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 stochastic SIS (susceptible-infected-susceptible) and SIR (susceptible-infected-recovered) models on high-dimensional lattices with random edge weights, where a susceptible vertex is infected by an…
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…
In this paper we are concerned with the SIR (Susceptible-Infective-Removed) epidemic on open clusters of bond percolation on the squared lattice. For the SIR model, a susceptible vertex is infected at rate proportional to the number of…
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 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 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…
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 study survival and extinction of a long-range infection process on a diluted one-dimensional lattice in discrete time. The infection can spread to distant vertices according to a Pareto distribution, however spreading is also prohibited…
A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its…
In this paper we are concerned with threshold-one contact processes on lattices. We show that the probability that the origin is infected converges to 0 at an exponential rate I in the subcritical case. Furthermore, we give a limit theorem…
We study the contact process running in the one-dimensional lattice undergoing dynamical percolation, where edges open at rate $vp$ and close at rate $v(1-p)$. Our goal is to explore how the speed of the environment, $v$, affects the…
We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…
In this paper we are concerned with the two-stage contact process on the lattice $\mathbb{Z}^d$ introduced in \cite{Krone1999}. We gives a limit theorem of the critical infection rate of the process as the dimension $d$ of the lattice grows…
We study the contact process on the long-range percolation cluster on $\mathbb{Z}$ where each edge $\langle i,j \rangle$ is open with probability $|i-j|^{-s}$ for $s> 2$. Using a renormalization procedure we apply Peierls-type argument to…
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…
We study the contact process in the regime of small infection rates on finite scale-free networks with stationary dynamics based on simultaneous updating of all connections of a vertex. We allow the update rates of individual vertices to…
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…