A note on recurrent random walks
Dimitrios Cheliotis
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.
Create a lesson
Related papers
Shannon's problem on the monotonicity of entropy and a Conjecture of Tao
Ziran Liu
Extinction, Survival and Fluctuations for the Spatial Maki--Thompson Model on Infinite Graphs
Luciano Henrique Lacerda de Araújo, Daniel Miranda Machado, Cristian Favio Coletti et al.
Phase Transition and Fluctuation Results for First-Passage Percolation on Spread-Out Cycle Graphs
Partha S. Dey, Daecheol Kim
Colorful Exponential Random Graph Models
Bhaswar B. Bhattacharya, Pierfrancesco Dionigi, Ankan Ganguly et al.
On (fake) Stationarity in Stochastic Volterra Equations with Affine Drift and Regular Kernels
Emmanuel Gnabeyeu, Gilles Pagès
Limit Laws of the Iterated Logarithm Under Sub-linear Expectations
Li-Xin Zhang, Yongsheng Song