English
Related papers

Related papers: On the transience of processes defined on Galton--…

200 papers

We consider a continuous-time vertex reinforced jump process on a supercritical Galton-Watson tree. This process takes values in the set of vertices of the tree and jumps to a neighboring vertex with rate proportional to the local time at…

Probability · Mathematics 2012-09-25 Anne-Laure Basdevant , Arvind Singh

We give an alternative proof of the fact that the vertex reinforced jump process on Galton- Watson tree has a phase transition between recurrence and transience as a function of c, the initial local time, see [3]. Further, applying the…

Probability · Mathematics 2016-11-28 Xinxin Chen , Xiaolin Zeng

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…

Probability · Mathematics 2016-05-02 A. D. Barbour , A. Collevecchio

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…

Probability · Mathematics 2016-05-18 Adam Bowditch

This thesis examines linearly edge-reinforced random walks on infinite trees. In particular, recurrence and transience of such random walks on general (fixed) trees as well as on Galton-Watson trees (i.e. random trees) is characterized, and…

Probability · Mathematics 2023-09-01 Fabian Michel

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

Consider a vertex-reinforced jump process defined on a regular tree, where each vertex has exactly $b$ children, with $b \ge 3$. We prove the strong law of large numbers and the central limit theorem for the distance of the process from the…

Probability · Mathematics 2009-07-29 Andrea Collevecchio

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

Probability · Mathematics 2015-03-13 Gabriel Faraud , Yueyun Hu , Zhan Shi

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

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

We consider a random walk on a Galton-Watson tree in random environment, in the subdiffusive case. We prove the convergence of the renormalised height function of the walk towards the continuous-time height process of a spectrally positive…

Probability · Mathematics 2019-04-19 Loïc de Raphélis

We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition of the…

Probability · Mathematics 2008-12-10 Anne-Laure Basdevant , Arvind Singh

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…

Probability · Mathematics 2019-06-21 Yuki Tokushige

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

Probability · Mathematics 2011-01-24 Gerard Ben Arous , Alan Hammond

The simple Galton--Watson process describes populations where individuals live one season and are then replaced by a random number of children. It can also be viewed as a way of generating random trees, each vertex being an individual of…

Statistics Theory · Mathematics 2008-11-17 Peter Jagers , Serik Sagitov

We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying (unreinforced) random walk has a bias towards or away from the root. We prove that in the setting of multiplicative…

Probability · Mathematics 2018-08-07 Andrea Collevecchio , Mark Holmes , Daniel Kious

In this paper we consider the one-dimensional, biased, randomly trapped random walk when the trapping times have infinite variance. We prove sufficient conditions for the suitably scaled walk to converge to a transformation of a stable…

Probability · Mathematics 2026-01-14 Adam Bowditch

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…

Probability · Mathematics 2026-03-26 Alexis Kagan

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

In this paper we study the recurrence and transience of the $\mathbb{Z}^d$-valued branching random walk in random environment indexed by a critical Bienaym\'e-Galton-Watson tree, conditioned to survive. The environment is made either of…

Probability · Mathematics 2025-01-03 Alexandre Legrand , Christophe Sabot , Bruno Schapira
‹ Prev 1 2 3 10 Next ›