arXiv Analytics

Sign in

arXiv:math/0610056 [math.PR]AbstractReferencesReviewsResources

A note on recurrent random walks

Dimitrios Cheliotis

Published 2006-10-02Version 1

For any recurrent random walk (S_n)_{n>0} on R, there are increasing sequences (g_n)_{n>0} converging to infinity for which (g_n S_n)_{n>0} has at least one finite accumulation point. For one class of random walks, we give a criterion on (g_n)_{n>0} and the distribution of S_1 determining the set of accumulation points for (g_n S_n)_{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 (g_n)_{n>0} of positive numbers for which liminf g_n|S_n|=0.

Comments: 8 pages
Journal: Statistics and Probability Letters 76 (2006) 1025-1031
Categories: math.PR
Subjects: 60F99
Related articles: Most relevant | Search more
arXiv:math/0409013 [math.PR] (Published 2004-09-01)
Non-intersecting, simple, symmetric random walks and the extended Hahn kernel
arXiv:2209.09901 [math.PR] (Published 2022-09-20)
Recurrence and transience of symmetric random walks with long-range jumps
arXiv:1511.02810 [math.PR] (Published 2015-11-09)
Exponentials and $R$-recurrent random walks on groups