Related papers: Frog models on trees through renewal theory
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more…
We determine the impact of resource renewal on the lifetime of a forager that depletes its environment and starves if it wanders too long without eating. In the framework of the minimal starving random walk model with resource renewal,…
The margins within the geographic range of species are often specific in terms of ecological and evolutionary processes, and can strongly influence the species' reaction to climate change. One of the frequently observed features at range…
We investigate the directed random walk on hierarchic trees. Two cases are investigated: random variables on deterministic trees with a continuous branching, and random variables on the trees constructed trough the random branching process.…
We develop nonlinear renewal theorems for a perturbed random walk without assuming stochastic boundedness of centered perturbation terms. A second order expansion of the expected stopping time is obtained via the uniform integrability of…
The aim of the current work is to prove a law of large numbers for the range size of recurrent rotor walks with random initial configuration on a general class of trees, called periodic trees or directed covers of graphs.
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
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 prove a law of large numbers for the range of rotor walks with random initial configuration on regular trees and on Galton-Watson trees. More precisely, we show that on the classes of trees under consideration, even in the case when the…
We describe a percolation-type approach to modeling of the processes of aging and certain other properties of tissues analyzed as systems consisting of interacting cells. Tissues are considered as structures made of regular healthy,…
In this work we investigate a class of random walks that interacts with its environment called Tree Builder Random Walk (TBRW). In our settings, at each step, the walker adds a random number of vertices to its position sampled according to…
Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various timescales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis…
In this paper we consider two continuous-mass population models as analogues of logistic branching random walks, one is supported on a finite trait space and the other one is supported on an infinite trait space. For the first model with…
We present continuum models that describe the evolution of the position of a random walker on a growing network using four different growth algorithms. Three of these involve a random element, including one in which the motility rate of the…
We introduce a simple tree growth process that gives rise to a new two-parameter family of discrete fragmentation trees that extends Ford's alpha model to multifurcating trees and includes the trees obtained by uniform sampling from…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
We prove a shape theorem for a growing set of simple random walks on Z^d, known as frog model. The dynamics of this process is described as follows: There are active particles, which perform independent discrete time SRWs, and sleeping…
We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…
Consider the following interacting particle system on the $d$-ary tree, known as the frog model: Initially, one particle is awake at the root and i.i.d. Poisson many particles are sleeping at every other vertex. Particles that are awake…