Extremes of local times for simple random walks on symmetric trees
Abstract
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 rn rooted at the (n-rn) level, where (rn)n ≥ 1 satisfies n ∞ rn = ∞ and n ∞ rn/n ∈ [0, 1). We show that the point process weakly converges to a Cox process with intensity measure α Z∞ (dx) e-2 b~ydy, where α > 0 is a constant and Z∞ is a random measure on [0, 1] which has the same law as the limit of a critical random multiplicative cascade measure up to a scale factor. As a corollary, we establish convergence in law of the maximum of local times over leaves to a randomly shifted Gumbel distribution.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.