English
Related papers

Related papers: Differentiability of the speed of biased random wa…

200 papers

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…

Probability · Mathematics 2021-11-24 Tianyi Bai , Pierre Rousselin

We consider a null recurrent random walk $\mathbb{X}$ on a super-critical Galton Watson marked tree $\mathbb{T}$ in the (sub-)diffusive regime. We are interested in the asymptotic behaviour of the local time of its root at $n$, which is the…

Probability · Mathematics 2023-12-27 Alexis Kagan

We consider a two-speed branching random walk, which consists of two macroscopic stages with different reproduction laws. We prove that the centered maximum converges in law to a Gumbel variable with a random shift and the extremal process…

Probability · Mathematics 2025-03-11 Lianghui Luo

We study a linear-fractional Bienaym\'e-Galton-Watson process with a general type space. The corresponding tree contour process is described by an alternating random walk with the downward jumps having a geometric distribution. This leads…

Probability · Mathematics 2016-03-07 Alexey Lindo , Serik Sagitov

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

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…

Probability · Mathematics 2022-04-12 Tianyi Bai , Yijun Wan

We study biased random walks on dynamical percolation on $\mathbb{Z}^d$. We establish a law of large numbers and an invariance principle for the random walk using regeneration times. Moreover, we verify that the Einstein relation holds, and…

Probability · Mathematics 2024-09-26 Sebastian Andres , Nina Gantert , Dominik Schmid , Perla Sousi

We prove the Einstein relation, relating the velocity under a small perturbation to the diffusivity in equilibrium, for certain biased random walks on Galton--Watson trees. This provides the first example where the Einstein relation is…

Probability · Mathematics 2011-12-23 Gerard Ben Arous , Yueyun Hu , Stefano Olla , Ofer Zeitouni

We consider biased random walks in positive random conductances on the d-dimensional lattice in the zero-speed regime and study their scaling limits. We obtain a functional Law of Large Numbers for the position of the walker, properly…

Probability · Mathematics 2016-09-07 Alexander Fribergh , Daniel Kious

We prove a quenched functional central limit theorem for a one-dimensional random walk driven by a simple symmetric exclusion process. This model can be viewed as a special case of the random walk in a balanced random environment, for which…

Probability · Mathematics 2021-07-20 Otávio Menezes , Jonathon Peterson , Yongjia Xie

We study biased random walk on the infinite connected component of supercritical percolation on the integer lattice $\mathbb{Z}^d$ for $d\geq 2$. For this model, Fribergh and Hammond showed the existence of an exponent $\gamma$ such that:…

Probability · Mathematics 2022-05-10 Adam M. Bowditch , David A. Croydon

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 consider the simple random walk on Galton-Watson trees with supercritical offspring distribution, conditioned on non-extinction. In case the offspring distribution has finite support, we prove an upper bound for the annealed return…

Probability · Mathematics 2025-01-22 Peter Müller , Jakob Stern

In this note, we make explicit the law of the renormalized supercritical branching random walk, giving credit to a conjecture formulated in a previous works of the authors for a continuous analog of the branching random walk. Also, in the…

Probability · Mathematics 2012-05-29 Julien Barral , Rémi Rhodes , Vincent Vargas

We consider a conditioned Galton-Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given length. We give two proofs of this result, one probabilistic and…

Probability · Mathematics 2008-12-18 Luc Devroye , Svante Janson

We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability p by studying three classes of…

Probability · Mathematics 2007-05-23 Dayue Chen , Fuxi Zhang

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…

Probability · Mathematics 2007-05-23 Erwin Bolthausen , Christine Ritzmann

Let $(W_n(\theta))_{n\in\mathbb N_0}$ be the Biggins martingale associated with a supercritical branching random walk and denote by $W_\infty(\theta)$ its limit. Assuming essentially that the martingale $(W_n(2\theta))_{n\in\mathbb N_0}$ is…

Probability · Mathematics 2016-01-14 Alexander Iksanov , Zakhar Kabluchko

We consider a weighted lattice $Z^d$ with conductance $\mu_e=|e|^{-\alpha}$. We show that the heat kernel of a variable speed random walk on it satisfies a two-sided Gaussian bound by using an intrinsic metric. We also show that when $d=2$…

Probability · Mathematics 2015-10-02 Xinxing Chen

We develop a technique that provides a lower bound on the speed of transient random walk in a random environment on regular trees. A refinement of this technique yields upper bounds on the first regeneration level and regeneration time. In…

Probability · Mathematics 2009-11-03 Andrea Collevecchio , Tom Schmitz