Related papers: Distance-dependent chase-escape on trees
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…
The frog model on the rooted d-ary tree changes from transient to recurrent as the number of frogs per site is increased. We prove that the location of this transition is on the same order as the degree of the tree.
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…
Spatial patterning can be crucially important for understanding the behavior of interacting populations. Here we investigate a simple model of parasite and host populations in which parasites are random walkers that must come into contact…
The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…
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 growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…
The present paper features results on global survival and extinction of an infection in a multi-layer network of mobile agents. Expanding on a model first presented in [CHJW22], we consider an urban environment, represented by line-segments…
We provide a uniform upper bound on the minimal drift so that the one-per-site frog model on a $d$-ary tree is recurrent. To do this, we introduce a subprocess that couples across trees with different degrees. Finding couplings for frog…
We are interested in modeling some two-level population dynamics, resulting from the interplay of ecological interactions and phenotypic variation of individuals (or hosts) and the evolution of cells (or parasites) of two types living in…
Two density-dependent branching processes are considered to model predator-prey populations. For both models, preys are considered to be the main food supply of predators. Moreover, in each generation the number of individuals of each…
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 show that for many models of random trees, the independence number divided by the size converges almost surely to a constant as the size grows to infinity; the trees that we consider include random recursive trees, binary and $m$-ary…
In this work, an individual-based model of forest insect outbreaks is presented. The results obtained show that the outbreak is an emerging feature of the system. It is a common product of the characteristics of insects, the environment in…
We introduce a general class of branching Markov processes for the modelling of a parasite infection in a cell population. Each cell contains a quantity of parasites which evolves as a diffusion with positive jumps. The growth rate,…
We consider a discrete-time host-parasite model for a population of cells which are colonized by proliferating parasites. The cell population grows like an ordinary Galton-Watson process, but in reflection of real biological settings the…
Consider a rooted $N$-ary tree. To every vertex of this tree, we attach an i.i.d. continuous random variable. A vertex is called accessible if along its ancestral line, the attached random variables are increasing. We keep accessible…
A subset of leaves of a rooted tree induces a new tree in a natural way. The density of a tree $D$ inside a larger tree $T$ is the proportion of such leaf-induced subtrees in $T$ that are isomorphic to $D$ among all those with the same…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
The frog model is an infection process in which dormant particles begin moving and infecting others once they become infected. We show that on the rooted $d$-ary tree with particle density $\Omega(d^2)$, the set of visited sites contains a…