Related papers: The Contact Process on Periodic Trees
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…
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…
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 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…
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…
The existence of a weak survival region is established for the anisotropic symmetric contact process on a homogeneous tree T_{2d} of degree 2d > 2: For parameter values in a certain connected region of positive Lebesgue measure, the…
The contact process is a simple model for the spread of an infection in a structured population. We investigate the case when the underlying structure evolves dynamically as a degree-dependent dynamical percolation model. Starting with a…
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…
This paper is concerned with a natural variant of the contact process modeling the spread of knowledge on the integer lattice. Each site is characterized by its knowledge, measured by a real number ranging from 0 = ignorant to 1 =…
Given a discrete spatial structure $X$, we define continuous-time branching processes that model a population breeding and dying on $X$. These processes are usually called branching random walks. They are characterized by breeding rates…
We study a spatial model of random permutations on trees with a time parameter $T>0$, a special case of which is the random stirring process. The model on trees was first analysed by Bj\"ornberg and Ueltschi[BU16], who established the…
We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…
We study the extinction time $\uptau$ of the contact process on finite trees of bounded degree. We show that, if the infection rate is larger than the critical rate for the contact process on $\Z$, then, uniformly over all trees of degree…
We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…
The renewal contact process, introduced in $2019$ by Fontes, Marchetti, Mountford, and Vares, extends the Harris contact process in $\mathbb{Z}^d$ by allowing the possible cure times to be determined according to independent renewal…
The main substance of the paper concerns the growth rate and the classification (ergodicity, transience) of a family of random trees. In the basic model, new edges appear according to a Poisson process of parameter $\lambda$ and leaves can…
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 renewal contact process is a non-Markovian variant of the classical contact process in which recoveries are governed by independent renewal processes with interarrival distribution $\mu$. We establish new sufficient conditions ensuring…
We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…
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.…