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.

25 pages

References in corpus (2)

• A transient Markov chain with finitely many cutpoints
• On the local time of the asymmetric Bernoulli walk