Maximal local time of randomly biased random walks on a Galton-Watson tree
Xinxin Chen (PSPM), Lo\"ic de Raph\'elis (IDP)

TL;DR
This paper investigates the maximum local time of a recurrent random walk on a Galton-Watson tree in a random environment, revealing its asymptotic behavior during multiple excursions.
Contribution
It introduces a novel analysis of the maximal local time using the structure of a multi-type Galton-Watson tree derived from the walk's edge local times.
Findings
Asymptotic behavior of the maximal local time during n excursions.
Characterization of the maximal type of the associated Galton-Watson tree.
Results apply to diffusive and sub-diffusive regimes.
Abstract
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. When the walk is the diffusive or sub-diffusive, by studying the maximal type of this Galton-Watson tree, we establish the asymptotic behaviour of the largest local times of this walk during n excursions, under the annealed law.
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 · Markov Chains and Monte Carlo Methods · Theoretical and Computational Physics
