The Exact Limsup Constant for Once-Visited Sites of One-Dimensional Simple Random Walk
Chenxu Feng, Chenxu Hao

TL;DR
This paper precisely determines the limsup constant for the number of sites visited exactly once by a one-dimensional simple random walk, establishing that it equals 1/16, using a novel iterative analysis framework.
Contribution
It computes the exact value of the limsup constant, 1/16, for once-visited sites in a 1D simple random walk, advancing understanding of its long-term behavior.
Findings
The limsup constant C for g_1(n)/log^2 n is exactly 1/16.
Introduces a self-boosting iterative framework for analysis.
Confirms the existence and exact value of the limsup constant.
Abstract
For a one-dimensional simple random walk, let denote the number of sites visited exactly once at time . Major (1988) proved that \begin{equation*} \limsup_{n\to\infty}\frac{g_1(n)}{\log^2 n}=C\qquad a.s. \end{equation*} where is a positive and finite constant. While this result settled the question of existence, the exact value of remained unknown. In this paper, we determine that . The main novelty of our work lies in introducing a self-boosting iterative framework for analysis.
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.
