Related papers: The phase transition for parking on Galton--Watson…
We consider a random interacting particle system, known as the frog model, on infinite Galton-Watson trees allowing offspring zero and one. The system starts with one awake particle (frog) at the root of the tree and a random number of…
We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking…
In the parking model on $\mathbb{Z}^d$, each vertex is initially occupied by a car (with probability $p$) or by a vacant parking spot (with probability $1-p$). Cars perform independent random walks and when they enter a vacant spot, they…
In this article, we study a simple random walk on a decorated Galton-Watson tree, obtained from a Galton-Watson tree by replacing each vertex of degree $n$ with an independent copy of a graph $G_n$ and gluing the inserted graphs along the…
We show a central limit theorem for random walk on a Galton-Watson tree, when the edges of the tree are assigned randomly uniformly elliptic conductances. When a positive fraction of edges is assigned a small conductance $\varepsilon$, we…
We consider the biased random walk on a critical Galton-Watson tree conditioned to survive, and confirm that this model with trapping belongs to the same universality class as certain one-dimensional trapping models with slowly-varying…
Consider a random walk in random environment on a supercritical Galton--Watson tree, and let $\tau_n$ be the hitting time of generation $n$. The paper presents a large deviation principle for $\tau_n/n$, both in quenched and annealed cases.…
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…
We consider the random conductance model, where the underlying graph is an infinite supercritical Galton--Watson tree, the conductances are independent but their distribution may depend on the degree of the incident vertices. We prove that,…
We propose a new way to condition random trees, that is, condition random trees to have large maximal out-degree. Under this new conditioning, we show that conditioned critical Galton-Watson trees converge locally to size-biased trees with…
We prove that the speed of $\lambda$-biased random walks on a supercritical Galton-Watson tree without leaves is differentiable when $\lambda\in(0,1)$, and give an expression of the derivative using a certain 2-dimensional Gaussian random…
We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…
Under minimal condition, we prove the local convergence of a critical multi-type Galton-Watson tree conditioned on having a large total progeny by types towards a multi-type Kesten's tree. We obtain the result by generalizing Neveu's strong…
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…
We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…
We analyze simple random walk on a supercritical Galton-Watson tree, where the walk is conditioned to return to the root at time $2n$. Specifically, we establish the asymptotic order (up to a constant factor) as $n\to\infty$, of the maximal…
We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…
We consider a marking procedure of the vertices of a tree where each vertex is marked independently from the others with a probability that depends only on its out-degree. We prove that a critical Galton-Watson tree conditioned on having a…
We study analytically the late time statistics of the number of particles in a growing tree model introduced by Aldous and Shields. In this model, a cluster grows in continuous time on a binary Cayley tree, starting from the root, by…