2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/133003We 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 pagesProbability60G50; 60F15; 60J55Transient NN random walk on the linetext