中文
相关论文

相关论文: Escape regimes of biased random walks on Galton-Wa…

200 篇论文

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…

概率论 · 数学 2012-03-20 David A. Croydon , Alexander Fribergh , Takashi Kumagai

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…

概率论 · 数学 2020-10-06 Adam Bowditch , Yuki Tokushige

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…

概率论 · 数学 2012-05-03 Alan Hammond

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

概率论 · 数学 2011-01-24 Gerard Ben Arous , Alan Hammond

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…

概率论 · 数学 2026-01-14 Adam Bowditch

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

概率论 · 数学 2015-03-13 Gabriel Faraud , Yueyun Hu , Zhan Shi

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…

概率论 · 数学 2026-03-26 Alexis Kagan

We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…

概率论 · 数学 2007-05-23 Andrea Collevecchio

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…

概率论 · 数学 2015-09-29 Yueyun Hu , Zhan Shi

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…

概率论 · 数学 2020-05-04 Adam Bowditch , Yuki Tokushige

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

概率论 · 数学 2011-01-11 Elie Aidekon

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…

概率论 · 数学 2018-08-07 Andrea Collevecchio , Mark Holmes , Daniel Kious

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…

概率论 · 数学 2014-04-16 Wei Su

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…

概率论 · 数学 2012-09-25 Anne-Laure Basdevant , Arvind Singh

In this paper, we study the time required for a {\lambda}-biased ({\lambda}>1) walk to visit all the vertices of a supercritical Galton-Watson tree up to generation n. Inspired by the extremal landscape approach in [Cortines, Louidor,…

概率论 · 数学 2020-03-18 Tianyi Bai

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…

概率论 · 数学 2025-01-22 Peter Müller , Jakob Stern

We prove CLTs for biased randomly trapped random walks in one dimension. In particular, we will establish an annealed invariance principal by considering a sequence of regeneration times under the assumption that the trapping times have…

概率论 · 数学 2016-11-22 Adam Bowditch

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…

概率论 · 数学 2019-04-19 Loïc de Raphélis

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…

概率论 · 数学 2012-10-24 David A. Croydon , Takashi Kumagai

Consider a class of null-recurrent randomly biased walks on a super-critical Gaton-Watson tree. We obtain the rates of convergence of the local times and the quenched local probability for the biased walk in the sub-diffusive case. These…

概率论 · 数学 2019-01-03 Yueyun Hu
‹ 上一页 1 2 3 10 下一页 ›