Scaling limit for local times and return times of a randomly biased walk on a Galton-Watson tree
Alexis Kagan

TL;DR
This paper studies the asymptotic behavior of local times and return times of a biased random walk on a Galton-Watson tree, showing convergence to stable Lévy processes, extending previous results by Hu.
Contribution
It extends existing results by analyzing the scaling limits of local and return times for a biased walk on Galton-Watson trees, revealing convergence to stable Lévy processes.
Findings
Local time at the root converges to a maximum of a stable Lévy process.
Return times to the root converge to a hitting time of a stable Lévy process.
Results generalize previous work by Hu (2017).
Abstract
We consider a null recurrent random walk on a super-critical Galton Watson marked tree in the (sub-)diffusive regime. We are interested in the asymptotic behaviour of the local time of its root at , which is the total amount of time spent by the random walk on the root of up to the time , and in its -th return time to the root of . We show that properly renormalized, this local time and this -th return time respectively converge in law to the maximum and to an hitting time of some stable L\'evy process. This paper aims in particular to extent the results of Y. Hu [Hu17].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Theoretical and Computational Physics · Markov Chains and Monte Carlo Methods
