





















We consider the randomly biased random walk on trees in the slow movement regime as in [HS16], whose potential is given by a branching random walk in the boundary case. We study the heavy range up to the $n$-th return to the root, i.e., the number of edges visited more than $k_n$ times. For $k_n=n^θ$ with $θ\in(0,1)$, we obtain the convergence in probability of the rescaled heavy range, which improves one result of [AD20].
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。