Fetching the paper…
Reading the bibliography…
We consider local times of the simple random walk on the $b$-ary tree of depth $n$ and study a point process which encodes the location of the vertex with the maximal local time and the properly centered maximum over leaves of each subtree of depth $r_n$ rooted at the $(n-r_n)$ level, where $(r_n)_{n \geq 1}$ satisfies $\lim_{n \to \infty} r_n = \infty$ and $\lim_{n \to \infty} r_n/n \in [0, 1)$.
Nothing clear enough to list yet.
Nothing clear enough to list yet.
Nothing clear enough to list yet.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…