The rate of escape of the most visited site of Brownian motion
Richard F. Bass

TL;DR
This paper proves that the most visited site of a one-dimensional Brownian motion escapes to infinity faster than a certain rate involving ^{1/2} and a logarithmic factor, confirming a conjecture by Lifshits and Shi.
Contribution
It establishes the asymptotic escape rate of the most visited site of Brownian motion, confirming a conjecture and extending results to simple random walk.
Findings
The most visited site diverges faster than ^{1/2} divided by a logarithmic factor for gamma>1.
The result holds almost surely for Brownian motion and simple random walk.
The paper confirms a conjecture of Lifshits and Shi regarding the escape rate.
Abstract
Let be the jointly continuous local times of a one-dimensional Brownian motion and let . Let be any point such that , a most visited site of Brownian motion. We prove that if , then\[\liminf_{t\to \infty} \frac{|V_t|}{\sqrt t/(\log t)^\gamma}=\infty, \qquad \mbox{a.s.}, \] with an analogous result for simple random walk. This proves a conjecture of Lifshits and Shi.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Stochastic processes and financial applications · Mathematical Dynamics and Fractals
