On the cover time of {\lambda}-biased walk on supercritical Galton-Watson trees
Probability
2020-03-18 v4
Abstract
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, Saglietti 2018] for the simple random walk on binary trees, we establish the scaling limit of the cover time in the biased setting.
Keywords
Cite
@article{arxiv.1905.05613,
title = {On the cover time of {\lambda}-biased walk on supercritical Galton-Watson trees},
author = {Tianyi Bai},
journal= {arXiv preprint arXiv:1905.05613},
year = {2020}
}