A note on recurrent random walks
Abstract
For any recurrent random walk (Sn)n>0 on R, there are increasing sequences (gn)n>0 converging to infinity for which (gn Sn)n>0 has at least one finite accumulation point. For one class of random walks, we give a criterion on (gn)n>0 and the distribution of S1 determining the set of accumulation points for (gn Sn)n>0. This extends, with a simpler proof, a result of K.L. Chung and P. Erdos. Finally, for recurrent, symmetric random walks, we give a criterion characterizing the increasing sequences (gn)n>0 of positive numbers for which liminf gn|Sn|=0.
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.