Related papers: The asymmetric multitype contact process
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…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
Let $\{G_i\}$ be the random graph process: starting with an empty graph $G_0$ with $n$ vertices, in every step $i \geq 1$ the graph $G_i$ is formed by taking an edge chosen uniformly at random among the non-existing ones and adding it to…
Realistic modeling of ecological population dynamics requires spatially explicit descriptions that can take into account spatial heterogeneity as well as long-distance dispersal. Here, we present Monte Carlo simulations and numerical…
We introduce and study a novel semi-random multigraph process, described as follows. The process starts with an empty graph on $n$ vertices. In every round of the process, one vertex $v$ of the graph is picked uniformly at random and…
We consider the long-term behaviour of critical multitype branching processes conditioned on non-extinction, both with respect to the forward and the ancestral processes. Forward in time, we prove a functional limit theorem in the space of…
We consider a birth-death process with the birth rates $i\lambda$ and death rates $i\mu +i(i-1)\theta$, where $i$ is the current state of the process. A positive competition rate $\theta$ is assumed to be small. In the supercritical case…
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 prove that the supercritical one-dimensional contact process survives in certain wedge-like space-time regions, and that when it survives it couples with the unrestricted contact process started from its upper invariant measure. As an…
Motivated by questions regarding long range percolation, we investigate a non-Markovian analogue of the Harris contact process in $\mathbb{Z}^d$: an individual is attached to each site $x \in \mathbb{Z}^d$, and it can be infected or…
The most general exclusion single species reaction-diffusion models with nearest-neighbor interactions one a one dimensional lattice are investigated, for which the evolution of full intervals are closed. Using a generating function method,…
We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…
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 popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…
It has been proposed (Phys. Rev. E {\bf 71}, 026121 (2005)) that unlike the short range contact process, a long-range counterpart may lead to the existence a discontinuous phase transition in one dimension. Aiming at exploring such link,…
Multi-type birth-death processes underlie approaches for inferring evolutionary dynamics from phylogenetic trees across biological scales, ranging from deep-time species macroevolution to rapid viral evolution and somatic cellular…
We study a family of interacting particle systems with annihilating and coalescing reactions. Two types of particles are interspersed throughout a transitive unimodular graph. Both types diffuse as simple random walks with possibly…
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…
he starting process with countable number of types \mu(t) generates a stopped branching process \xi(t). The starting process stops, by falling into the nonempty set S. It is assumed, that the starting process is subcritical, indecomposable…
Inspired by strict-monotonicity criteria for the time constant in first passage percolation, we investigate convex ordering of point processes in relation to the time constant in first contact percolation. In a nutshell, first contact…