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

Tianyi Bai

Stochastic Processes and their Applications, 2020, vol. 130, issue 11, 6863-6879

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 et al. (2018) for the simple random walk on binary trees, we establish the scaling limit of the cover time in the biased setting.

Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304414920303124
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:130:y:2020:i:11:p:6863-6879

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spa.2020.07.001

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().