A limit law for the most favorite point of simple random walk on a regular tree
arXiv:2111.09513 · doi:10.1214/23-AOP1644
Abstract
We consider a continuous-time random walk on a regular tree of finite depth and study its favorite points among the leaf vertices. For the walk started from a leaf vertex and stopped upon hitting the root we prove that, in the limit as as the depth of the tree tends to infinity, the suitably scaled and centered maximal time spent at any leaf converges to a randomly-shifted Gumbel law. The random shift is characterized using a derivative-martingale like object associated with square-root local-time process on the tree.
arXiv comment47 pages
References in corpus (17)
- Convergence in law of the minimum of a branching random walk
- Extreme local extrema of two-dimensional discrete Gaussian free field
- Convergence of the centered maximum of log-correlated Gaussian fields
- Full extremal process, cluster law and freezing for the two-dimensional discrete Gaussian Free Field
- Poissonian statistics in the extremal process of branching Brownian motion
- Asymptotics of cover times via Gaussian free fields: Bounded-degree graphs and general trees
- Planar Brownian motion and Gaussian multiplicative chaos
- Extrema of the two-dimensional Discrete Gaussian Free Field
- On intermediate level sets of two-dimensional discrete Gaussian Free Field
- Thick points of random walk and the Gaussian free field
- Characterisation of planar Brownian multiplicative chaos
- Exceptional points of two-dimensional random walks at multiples of the cover time
- Critical Brownian multiplicative chaos
- Exceptional points of discrete-time random walks in planar domains
- Multiplicative chaos of the Brownian loop soup
- Near-maxima of the two-dimensional Discrete Gaussian Free Field
- Decorated Random Walk Restricted to Stay Below a Curve (Supplement Material)