Related papers: Range and critical generations of a random walk on…
We focus on recurrent random walks in random environment (RWRE) on Galton-Watson trees. The range of these walks, that is the number of sites visited at some fixed time, has been studied in three different papers [AC18], [AdR17] and [dR16].…
In this paper we are interested in a random walk in a random environment on a super-critical Galton-Watson tree. We focus on the recurrent cases already studied by Y. Hu and Z. Shi and G. Faraud. We prove that the largest generation…
We study a branching random walk (BRW) taking its values in a random tree $\bT$ (seen as a family tree) with an infinite line of ancestors that is a variant of a supercritical Galton--Watson (GW) tree with offspring distribution $\nu$. The…
We consider the randomly biased random walk on trees in the slow movement regime as in [HS16], whose potential is given by a branching random walk in the boundary case. We study the heavy range up to the $n$-th return to the root, i.e., the…
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.…
In this paper we consider a null recurrent random walk in random environment on a super-critical Galton-Watson tree. We consider the case where the log-Laplace transform $\psi$ of the branching process satisfies $\psi(1)=\psi'(1)=0$ for…
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…
In this paper, we show that a Galton-Watson tree conditioned to have a fixed number of particles in generation $n$ converges in distribution as $n\rightarrow\infty$, and with this tool we study the span and gap statistics of a branching…
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…
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…
By introducing a new measure for the infinite Galton-Watson process and providing estimates for (discrete) Green's functions on trees, we establish the asymptotic behavior of the capacity of critical branching random walks: in high…
We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…
We consider a null-recurrent randomly biased walk $\mathbb{X}$ on a Galton-Watson tree in the (sub)-diffusive regime and we prove that properly renormalized, the local time in a critical generation converges in law towards some function of…
We consider a recurrent random walk on a rooted tree in random environment given by a branching random walk. Up to the first return to the root, its edge local times form a Multi-type Galton-Watson tree with countably infinitely many types.…
In this work, we are interested in the set of visited vertices of a tree $\mathbb{T}$ by a randomly biased random walk $\mathbb{X}:=(X_n,n \in \mathbb{N})$. The aim is to study a generalized range, that is to say the volume of the trace of…
We are interested in the randomly biased random walk on the supercritical Galton--Watson tree. Our attention is focused on a slow regime when the biased random walk $(X_n)$ is null recurrent, making a maximal displacement of order of…
We consider a branching random walk (BRW) taking its values in the $\mathtt{b}$-ary rooted tree $\mathbb W_{ \mathtt{b}}$ (i.e. the set of finite words written in the alphabet $\{ 1, \ldots, \mathtt{b} \}$, with $\mathtt{b}\! \geq \! 2$).…
We investigate the range $\mathcal{R}_T$ of the diffusive biased walk $\mathbb{X}$ on a Galton-Watson tree $\mathbb{T}$ in random environment, that is to say the sub-tree of $\mathbb{T}$ of all distinct vertices visited by this walk up to…
We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…
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…