On the cover time of \(\lambda\)-biased walk on supercritical Galton-Watson trees

DOI10.1016/j.spa.2020.07.001zbMath1459.05040arXiv1905.05613OpenAlexW3041501501MaRDI QIDQ2229565

Tianyi Bai

Publication date: 18 February 2021

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.05613

zbMATH Keywords

probability measurecover timesupercritical Galton-Watson tree

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05) Probabilistic measure theory (60A10)

Cites Work

• Unnamed Item
• A sharp estimate for cover times on binary trees
• On cover times for 2D lattices
• Cover times, blanket times, and majorizing measures
• The subleading order of two dimensional cover times
• Covering problems for Markov chains
• Random walk covering of some special trees
• Barrier estimates for a critical Galton-Watson process and the cover time of the binary tree
• Exponential concentration of cover times
• Cover times for Brownian motion and random walks in two dimensions
• A Ray-Knight theorem for symmetric Markov processes.
• Tightness for the cover time of the two dimensional sphere
• The number of generations entirely visited for recurrent random walks in a random environment
• A tight upper bound on the cover time for random walks on graphs
• A tight lower bound on the cover time for random walks on graphs
• A Limit Theorem for Multidimensional Galton-Watson Processes
• Improved classical limit analogues for Galton-Watson processes with or without immigration