English
Related papers

Related papers: Biased random walks on a Galton-Watson tree with l…

200 papers

We study $\lambda$-biased branching random walks on Bienaym\'e--Galton--Watson trees in discrete time. We consider the maximal displacement at time $n$, $\max_{\vert u \vert =n} \vert X(u) \vert$, and show that it almost surely grows at a…

Probability · Mathematics 2026-03-02 Julien Berestycki , Nina Gantert , David Geldbach , Quan Shi

We consider the slow movement of randomly biased random walk $(X_n)$ on a supercritical Galton--Watson tree, and are interested in the sites on the tree that are most visited by the biased random walk. Our main result implies tightness of…

Probability · Mathematics 2015-02-11 Yueyun Hu , Zhan Shi

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].…

Probability · Mathematics 2018-12-21 Pierre Andreoletti , Roland Diel

Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=0) on T is the nearest-neighbor random walk which, when at a…

Probability · Mathematics 2012-05-08 Amir Dembo , Nike Sun

We study properties of the harmonic measure of balls in large critical Galton-Watson trees whose offspring distribution is in the domain of attraction of a stable distribution with index $\alpha\in (1,2]$. Here the harmonic measure refers…

Probability · Mathematics 2014-05-08 Shen Lin

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…

Probability · Mathematics 2012-03-20 David A. Croydon , Alexander Fribergh , Takashi Kumagai

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…

Probability · Mathematics 2022-08-02 Eleanor Archer

Consider biased random walks on two Galton-Watson trees without leaves having progeny distributions $P_1$ and $P_2$ (GW$(P_1)$ and GW$(P_2)$) where $P_1$ and $P_2$ are supported on positive integers and $P_1$ dominates $P_2$ stochastically.…

Probability · Mathematics 2015-06-12 Behzad Mehrdad , Sanchayan Sen , Lingjiong Zhu

The speed $v(\beta)$ of a $\beta$-biased random walk on a Galton-Watson tree without leaves is increasing for $\beta \geq 717$.

Probability · Mathematics 2011-11-28 Gerard Ben Arous , Alexander Fribergh , Vladas Sidoravicius

We prove that the speed of a biased random walk on a supercritical Galton-Watson tree conditioned to survive is analytic within the ballistic regime. This extends the previous work arXiv:1906.07913 in which it was shown that the speed is…

Probability · Mathematics 2020-10-06 Adam Bowditch , Yuki Tokushige

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,…

Probability · Mathematics 2015-03-17 Nina Gantert , Sebastian Müller , Serguei Popov , Marina Vachkovskaia

We prove that the speed of a $\lambda$-biased random walk on a supercritical Galton-Watson tree is differentiable for $\lambda$ such that the walk is ballistic and obeys a central limit theorem, and give an expression of the derivative…

Probability · Mathematics 2020-05-04 Adam Bowditch , Yuki Tokushige

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.…

Probability · Mathematics 2020-10-02 Xinxin Chen , Loïc de Raphélis

Ben Arous, Fribergh and Sidoravicius \cite{GAV2014} proved that speed of biased random walk $RW_\lambda$ on a Galton-Watson tree without leaves is strictly decreasing for $\lambda\leq \frac{m_1}{1160},$ where $m_1$ is minimal degree of the…

Probability · Mathematics 2016-10-27 Song He , Wang Longmin , Xiang Kainan

We study the extremes of branching random walks under the assumption that the underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or they have lighter tails. In the…

Probability · Mathematics 2022-07-05 Souvik Ray , Rajat Subhra Hazra , Parthanil Roy , Philippe Soulier

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…

Probability · Mathematics 2011-12-19 Pierre Andreoletti , Pierre Debs

We show that the trace of the null recurrent biased random walk on a Galton-Watson tree properly renormalized converges to the Brownian forest. Our result extends to the setting of the random walk in random environment on a Galton-Watson…

Probability · Mathematics 2015-09-25 Elie Aïdékon , Loïc de Raphélis

We study the typical behavior of the harmonic measure of balls in large critical Galton-Watson trees whose offspring distribution has finite variance. The harmonic measure considered here refers to the hitting distribution of height $n$ by…

Probability · Mathematics 2016-03-04 Shen Lin

In this note, we prove a quenched functional central limit theorem for a biased random walk on a supercritical Galton-Watson tree with leaves. This extends a result of Peres and Zeitouni (2008) where the case without leaves is considered. A…

Probability · Mathematics 2017-01-17 Adam Bowditch

We are interested in the asymptotic behavior of critical Galton-Watson trees whose offspring distribution may have infinite variance, which are conditioned on having a large fixed number of leaves. We first find an asymptotic estimate for…

Probability · Mathematics 2014-11-14 Igor Kortchemski