English

Maximal local time of randomly biased random walks on a Galton-Watson tree

Probability 2020-10-02 v2

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.

Keywords

Cite

@article{arxiv.2009.13816,
  title  = {Maximal local time of randomly biased random walks on a Galton-Watson tree},
  author = {Xinxin Chen and Loïc de Raphélis},
  journal= {arXiv preprint arXiv:2009.13816},
  year   = {2020}
}

Comments

61 pages, 18 ref