






















We consider the range $R^{(n)}$, the tree made up of visited vertices by a diffusive null-recurrent randomly biased walk $\mathbb{X}$ on a Galton-Watson tree $\mathbb{T}$ up to the $n$-th return time to its root and we consider the following genealogy problem: pick two vertices uniformly at random in a generation of order $n$ in the tree $R^{(n)}$. Where does the coalescence occur? it turns out that the coalescence happens either in the recent past or in the remote past.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。