arXiv · 0707.0734
Transient NN random walk on the line
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Endre Csáki, Antónia Földes, Pál Révész. 2007-07-05. Transient NN random walk on the line. https://arxiv.org/abs/0707.0734
Cite the original work for its findings. Save a collection to share your selection of sources.