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. The particles of the second type spread with exponential rate λ. They colonize the neighboring vertices that are either vacant or occupied by the representatives of the opposite type, and annihilate the particles of the type 1 as they reach them. There exists a critical value λ_c =(2d - 1) + \sqrt{(2d -1)^2 -1} such that the first type survives with positive probability for λ< λ_c, and dies out with probability one for λ> λ_c.
We also find the growth profile which characterizes the rate of growth of the type 1 in the space-time on the event of survival.
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 parasite.
We study biased random walk on subcritical and supercritical Galton-Watson trees conditioned to survive in the transient, sub-ballistic regime. By considering offspring laws with infinite variance, we extend previously known results for the walk on the supercritical tree and observe new trapping phenomena for the walk on the subcritical tree which, in this case, always yield sub-ballisticity. This is contrary to the walk on the supercritical tree which always has some ballistic phase.
Suppose we are given a homogeneous tree $\mathcal{T}_q$ of degree $q\geq 3$, where at each vertex sits a lamp, which can be switched on or off. This structure can be described by the wreath product $(\mathbb{Z}/2)\wr Γ$, where $Γ=\ast_{i=1}^q \mathbb{Z}/2$ is the free product group of $q$ factors $\mathbb{Z}/2$. We consider a transient random walk on a Cayley graph of $(\mathbb{Z}/2)\wr Γ$, for which we want to compute lower and upper bounds for the rate of escape, that is, the speed at which the random walk flees to infinity.
Chase-escape is a competitive growth process in which red particles spread to adjacent uncolored sites, while blue particles overtake adjacent red particles. We introduce the variant in which red particles die and describe the phase diagram for the resulting process on infinite d-ary trees. A novel connection to weighted Catalan numbers makes it possible to characterize the critical behavior.
The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an infinite rooted tree, restarted from the root after each escape to infinity. We prove that the limiting proportion of escapes to infinity equals the escape probability for random walk, provided only finitely many rotors send the walker initially towards the root. For i.i.d. random initial rotor directions on a regular tree, the limiting proportion of escapes is …
We consider families of discrete time birth and death chains on trees, and show that in presence of a drift towards the root of the tree, the chains exhibit cut-off behavior along the drift and escape behavior in the opposite direction.
We study a competitive stochastic growth model called chase-escape in which red particles spread to adjacent uncolored sites and blue only to adjacent red sites. Red particles are killed when blue occupies the same site. If blue has rate-1 passage times and red rate-$λ$, a phase transition occurs for the probability red escapes to infinity on $\mathbb Z^d$, $d$-ary trees, and the ladder graph $\mathbb Z \times \{0,1\}$. The result on the tree was known, but we provide a new, simpler calculation of the critical value, and observe that it is a lower bound for a variety of graphs. We conclude by …
Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little is known about random walks that construct the graph where they walk while moving around. In this paper we study one of the simplest conceivable discrete time models of this kind, which works as follows: before every walker step, with probability $p$ a new leaf is added to the vertex currently occupied by the walker. The model grows trees and we call it the Bernoulli Growth Random Walk (BGRW). We show that the BGRW wa…
We are interested in predator-prey dynamics on infinite trees, which can informally be seen as particular two-type branching processes where individuals may die (or be infected) only after their parent dies (or is infected). We study two types of such dynamics: the chase-escape process, introduced by Kordzakhia with a variant by Bordenave, and the birth-and-assassination process, introduced by Aldous & Krebs. We exhibit a coupling between these processes and branching random walks starting from a random point and killed at the barrier 0. This sheds new light on the chase-escape and birth-and-a…
We prove the kernel estimates related to subordinated semigroups on homogeneous trees. We study the long time propagation problem. We exploit this to show exit time estimates for (large) balls. We use an abstract setting of metric measure spaces. This enables us to give these results for trees end hyperbolic spaces as well. Finally, we show some estimates for the Poisson kernel of a ball.
In this paper, we consider the threshold-one contact process and the threshold-one voter model w/o spontaneous death on homogeneous trees $\mathbb{T}_d$, $d\ge 2$. Mainly inspired by the corresponding arguments for ordinary contact processes, we prove that the complete convergence theorem holds for these three systems under strong survival. When the systems survives weakly, complete convergence may also hold under certain transition and/or initial conditions.
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 a random number of jumps, with geometric distribution. We prove an upper bound for the critical parameter of survival of the model, which improves the previously known results. This upper bound was conjectured in a paper by Lebensztayn et al. ($ J. Stat. Phys.$, 119(1-2), 331-345, 2005). We also give a closed formula for the upper bound.
We consider the frog model with geometric lifetime (parameter $1-p$) on homogeneous trees of dimension $d$. In 2002, \cite{alves2002-2} proved that there exists a critical lifetime parameter $p_c\in(0,1)$ above which infinitely many frogs are activated with positive probability, and they gave lower and upper bounds for $p_c$. Since then, the literature on this model focussed on refinements of the upper bound. In the present paper we improve the bounds for $p_c$ \emph{on both sides}. We also provide a discussion comparing the bounds of the literature and their proofs. Our proofs are based on co…
This paper belongs to a series of papers aiming to investigate scaling limits of Crump-Mode-Jagers (CMJ) trees. In the previous two papers we identified general conditions under which CMJ trees belong to the universality class of Galton-Watson and Bellman-Harris processes. In this paper we identify general conditions for CMJ trees to belong to the universality class of binary, homogeneous CMJ trees. These conditions state that the offspring process should 'look like' a renewal process, and also that it should not accumulate too many atoms near the origin. We show in particular that any renewal…
We study a rumour model from a percolation theory and branching process point of view. The existence of a giant component is related to the event where the rumour, which started from the root of a tree, spreads out through an infinite number of its vertices. We present lower and upper bounds for the probability of that event, according to the distribution of the random variables that defines the radius of influence of each individual. We work with Galton-Watson branching trees (homogeneous and non-homogeneous) and spherically symmetric trees which includes homogeneous and $k-$periodic trees.
Treebolic space is an analog of the Sol geometry, namely, it is the horocylic product of the hyperbolic upper half plane H and the homogeneous tree T with degree p+1 > 2, the latter seen as a one-complex. Let h be the Busemann function of T with respect to a fixed boundary point. Then for real q > 1 and integer p > 1, treebolic space HT(q,p) consists of all pairs (z=x+i y,w) in H x T with h(w) = log_{q} y. It can also be obtained by glueing together horziontal strips of H in a tree-like fashion. We explain the geometry and metric of HT and exhibit a locally compact group of isometries (a horoc…
We consider the contact process with infection rate $λ$ on $\mathbb{T}_n^d$, the $d$-ary tree of height $n$. We study the extinction time $τ_{\mathbb{T}_n^d}$, that is, the random time it takes for the infection to disappear when the process is started from full occupancy. We prove two conjectures of Stacey regarding $τ_{\mathbb{T}_n^d}$. Let $λ_2$ denote the upper critical value for the contact process on the infinite $d$-ary tree. First, if $λ< λ_2$, then $τ_{\mathbb{T}_n^d}$ divided by the height of the tree converges in probability, as $n \to \infty$, to a positive constant. Second, if $λ>…
We investigate a basic immigration process where colonies grow, during a random time, according to a general counting process until collapse. Upon collapse a random amount of individuals survive. These survivors try independently establishing new colonies at neighbour sites. Here we consider this general process subject to two schemes, Poisson growth with geometric catastrophe and Yule growth with binomial catastrophe. Independent of everything else colonies growth, during an exponential time, as a Poisson (or Yule) process and right after that exponential time their size is reduced according …
The study of discrete-time stochastic processes on the half-line with mean drift at $x$ given by $μ_1 (x) \to 0$ as $x \to \infty$ is known as Lamperti's problem. We give sharp almost-sure bounds for processes of this type in the case where $μ_1 (x)$ is of order $x^{-β}$ for some $β\in (0,1)$. The bounds are of order $t^{1/(1+β)}$, so the process is super-diffusive but sub-ballistic (has zero speed). We make minimal assumptions on the moments of the increments of the process (finiteness of $(2+2β+\varepsilon)$-moments for our main results, so 4th moments certainly suffice) and do not assume th…
The constant rate birth--death process is a popular null model for speciation and extinction. If one removes extinct and non-sampled lineages, this process induces `reconstructed trees' which describe the relationship between extant lineages. We derive the probability density of the length of a randomly chosen pendant edge in a reconstructed tree. For the special case of a pure-birth process with complete sampling, we also provide the probability density of the length of an interior edge, of the length of an edge descending from the root, and of the diversity (which is the sum of all edge leng…
We study the threshold $theta geq 2$ contact process on a homogeneous tree $T_b$ of degree $kappa = b + 1$, with infection parameter $lambda geq 0$ and started from a product measure with density $p$. The corresponding mean-field model displays a discontinuous transition at a critical point $lambda_c^{MF}(kappa,theta)$ and for $lambda geq lambda_c^{MF}(kappa,theta)$ it survives iff $p geq p_c^{MF}(kappa,theta,lambda)$, where this critical density satisfies $0 < p_c^{MF}(kappa,theta,lambda) < 1$, $lim_{lambda to infty} p_c^{MF}(kappa,theta,lambda) = 0$. For large $b$, we show that the process o…
This paper is concerned with the continuous-time quantum walk on Z, Z^d, and infinite homogeneous trees. By using the generating function method, we compute the limit of the average probability distribution for the general isotropic walk on Z, and for nearest-neighbor walks on Z^d and infinite homogeneous trees. In addition, we compute the asymptotic approximation for the probability of the return to zero at time t in all these cases.
Asymptotics for Beta-Splitting Trees via Homogeneous Fragmentations and Meromorphic Potential Theory
Faculty of Mathematics and Informatics, Sofia University “St. Kliment Ohridski”, Bulgaria（索非亚大学“圣克利门特奥赫里德斯基”数学与信息学院）；Institute of Mathematics, University of Zurich, Switzerland（苏黎世大学数学研究所）；Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria（保加利亚科学院数学与信息研究所）
We study a discrete Susceptible-Infected-Recovered (SIR) model for the spread of infectious disease on a homogeneous tree and the limit behavior of the model in the case when the tree vertex degree tends to infinity. We obtain the distribution of the time it takes for a susceptible vertex to get infected in terms of a solution of a non-linear integral equation under broad assumptions on the model parameters. Namely, infection rates are assumed to be time-dependent, and recovery times are given by random variables with a fairly arbitrary distribution. We then study the behavior of the model in …
We provide information about the asymptotic regimes for a homogeneous fragmentation of a finite set. We establish a phase transition for the asymptotic behaviours of the shattering times, defined as the first instants when all the blocks of the partition process have cardinality less than a fixed integer. Our results may be applied to the study of certain random split trees.
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 population survives forever with positive probability but ultimately vacates every finite subset of the tree with probability one. In this phase, infection trails must converge to the geometric boundary Ωof the tree. The random subset Λof the boundary consisting of all ends of the tree in which the infection survives, called the limit set of the process, is shown t…
When normal and misère games are played on bi-type binary Galton-Watson trees (with vertices coloured blue or red and each having either no child or precisely $2$ children), with one player allowed to move along monochromatic edges and the other along non-monochromatic edges, the draw probabilities equal $0$ unless every vertex gives birth to one blue and one red child. On bi-type Poisson trees where each vertex gives birth to Poisson$(λ)$ offspring in total, the draw probabilities approach $1$ as $λ\rightarrow \infty$. We study such \emph{novel} versions of normal, misère and escape games on …
Let ${\cal G}$ be the incipient infinite cluster (IIC) for percolation on a homogeneous tree of degree $n_0+1$. We obtain estimates for the transition density of the continuous time simple random walk $Y$ on ${\cal G}$; the process satisfies anomalous diffusion and has spectral dimension 4/3.
