Transient NN random walk on the line
Probability
2007-07-06 v1
Abstract
We prove strong theorems for the local time at infinity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over which the walk runs through (always from left to right) without ever returning.
Cite
@article{arxiv.0707.0734,
title = {Transient NN random walk on the line},
author = {Endre Csáki and Antónia Földes and Pál Révész},
journal= {arXiv preprint arXiv:0707.0734},
year = {2007}
}
Comments
25 pages