Related papers: The contact process on finite homogeneous trees re…
We consider the interacting particle system on the homogeneous tree of degree $(d + 1)$, known as frog model. In this model, active particles perform independent random walks, awakening all sleeping particles they encounter, and dying after…
Consider a random walk on a tree $G=(V,E)$. For $v,w \in V$, let the hitting time $H(v,w)$ denote the expected number of steps required for the random walk started at $v$ to reach $w$, and let $\pi_v = \mathrm{deg}(v)/2|E|$ denote the…
We consider local times of the simple random walk on the $b$-ary tree of depth $n$ and study a point process which encodes the location of the vertex with the maximal local time and the properly centered maximum over leaves of each subtree…
We consider an interacting particle system where equal-sized populations of two types of particles move by random walk steps on a graph, the two types may have different speeds, and meetings of opposite-type particles result in…
We give a necessary and sufficient condition for species coexistence in a parasite-host growth process on infinite $d$-ary trees. The novelty of this work is that the spreading and death rates for hosts depend on the distance to the nearest…
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…
We prove for the contact process on $Z^d$, and many other graphs, that the upper invariant measure dominates a homogeneous product measure with large density if the infection rate $\lambda$ is sufficiently large. As a consequence, this…
We investigate the random loop model on the $d$-ary tree. For $d \geq 3$, we establish a (locally) sharp phase transition for the existence of infinite loops. Moreover, we derive rigorous bounds that in principle allow to determine the…
The asymptotic shape theorem for the contact process in random environment gives the existence of a norm $\mu$ on $\Rd$ such that the hitting time $t(x)$ is asymptotically equivalent to $\mu(x)$ when the contact process survives. We provide…
We study the two-species diffusion-annihilation process, $A+B\rightarrow$ \O, on the fully-connected lattice. Probability distributions for the number of particles and the reaction time are obtained for a finite-size system using a master…
We study a two-level contact process. We think of fleas living on a species of animals. The animals are a supercritical contact process in $\mathbb{Z}^d$. The contact process acts as the random environment for the fleas. The fleas do not…
The space requirements of an $m$-ary search tree satisfies a well-known phase transition: when $m\leq 26$, the second order asymptotics is Gaussian. When $m\geq 27$, it is not Gaussian any longer and a limit $W$ of a complex-valued…
We study two famous interacting particle systems, the so-called Richardson's model and the contact process, when we add a stirring dynamics to them. We prove that they both satisfy an asymptotic shape theorem, as their analogues without…
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…
In this paper we show that on bounded degree graphs and general trees, the cover time of the simple random walk is asymptotically equal to the product of the number of edges and the square of the expected supremum of the Gaussian free field…
We study the following growth model on a regular d-ary tree. Points at distance n adjacent to the existing subtree are added with probabilities proportional to alpha^{-n}, where alpha<1 is a positive real parameter. The heights of these…
The frog model is a growing system of random walks where a particle is added whenever a new site is visited. A longstanding open question is how often the root is visited on the infinite $d$-ary tree. We prove the model undergoes a phase…
We find a continuum of extinction rates for solutions $u(y,\tau)\ge 0$ of the fast diffusion equation $u_\tau=\Delta u^m$ in a subrange of exponents $m\in (0,1)$. The equation is posed in $\ren$ for times up to the extinction time $T>0$.…
An infection spreads in a binary tree of height n as follows: initially, each leaf is either infected by one of k states or it is not infected at all. The infection state of each leaf is independently distributed according to a probability…
We give an explicit construction of the increasing tree-valued process introduced by Abraham and Delmas using a random point process of trees and a grafting procedure. This random point process will be used in companion papers to study…