arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1905.05613math.PR
收藏

超临界Galton-Watson树上λ-有偏行走的覆盖时间

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

Tianyi Bai

摘要:

本文研究了一个λ-有偏(λ>1)遍历到第n代的超临界Galton-Watson树的所有顶点所需的时间。受[Cortines,Louidor,Saglietti 2018]中用于二叉树上简单随机游动的极值景观方法的启发,我们在有偏设置中建立了覆盖时间的缩放限制。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑