On the cover time of λ-biased walk on supercritical Galton-Watson trees

2019/05/14 by Tianyi Bai, Bai, Tianyi
Mathematics · Physics and Astronomy · #60F05 #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Probability (math.PR) #Stochastic processes and statistical mechanics #Theoretical and Computational Physics

paper · pdf · doi:10.48550/arxiv.1905.05613

openalex publication_date 2019/05/14 · openalex created_date 2024/04/11 · openalex updated_date 2026/07/28

Abstract

In this paper, we study the time required for a λ-biased (λ>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.

Related

• Scaling limit for the cover time of the λ-biased random walk on a binary tree with λ<1
• A quenched central limit theorem for biased random walks on\n supercritical Galton-Watson trees
• Central limit theorem for biased random walk on multi-type Galton-Watson trees
• Regularity results of the speed of biased random walks on Galton-Watson trees
• Favorite sites of randomly biased walks on a supercritical Galton-Watson tree