Related papers: The Contact Process on Periodic Trees
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…
The contact process is a simple model for the spread of an infection in a structured population. We consider a variant of this process on Bienaym\'e-Galton-Watson trees, where vertices are equipped with a random fitness representing…
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…
There are two types of particles interacting on a homogeneous tree of degree d + 1. The particles of the first type colonize the empty space with exponential rate 1, but cannot take over the vertices that are occupied by the second type.…
Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least…
To study later spatial evolutionary games based on the multitype contact process, we first focus in this paper on the conditions for survival/extinction in the presence of only one strategy, in which case our model consists of a variant of…
We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…
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…
We consider the contact process near an extended surface defect, where the local control parameter deviates from the bulk one by an amount of $\lambda(l)-\lambda(\infty) = A l^{-s}$, $l$ being the distance from the surface. We concentrate…
By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…
The critical behavior of the contact process in disordered and periodic binary 2d-lattices is investigated numerically by means of Monte Carlo simulations as well as via an analytical approximation and standard mean field theory.…
Real-world examples of periods of periodical organisms range from cicadas whose life-cycles are larger prime numbers, like 13 or 17, to bamboos whose periods are large multiples of small primes, like 40 or even 120. The periodicity is…
In this paper we introduce a contact process in an evolving random environment (CPERE) on a connected and transitive graph with bounded degree, where we assume that this environment is described through an ergodic spin systems with finite…
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…
We consider the random wetting transition on the Cayley tree, i.e. the problem of a directed polymer on the Cayley tree in the presence of random energies along the left-most bonds. In the pure case, there exists a first-order transition…
We consider the contact process on a random graph with fixed degree distribution given by a power law. We follow the work of Chatterjee and Durrett, who showed that for arbitrarily small infection parameter $\lambda$, the survival time of…
We study bootstrap percolation with the threshold parameter $\theta \geq 2$ and the initial probability $p$ on infinite periodic trees that are defined as follows. Each node of a tree has degree selected from a finite predefined set of…
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 locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…
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…