Extremal process of the local time of simple random walk on a regular tree
Abstract
We study a continuous-time simple random walk on a regular rooted tree of depth n in two settings: either the walk is started from a leaf vertex and run until the tree root is first hit or it is started from the root and run until it has spent a prescribed amount of time there. In both cases we show that the extremal process associated with centered square-root local time on the leaves tends, as n∞, to a decorated Poisson point process with a random intensity measure. While the intensity measure is specific to the local-time problem at hand, the decorations are exactly those for the tree-indexed Markov chain (a.k.a. Branching Random Walk or Gaussian Free Field) with normal step distribution. The proof demonstrates the latter by way of a Lindeberg-type swap of the decorations of the two processes which itself relies on a well-known isomorphism theorem.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.