Transient nearest neighbor random walk on the line

Endre Csáki, Antónia Földes, Pál Révész

Research output: Contribution to journalArticle

5 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)100-122
Number of pages23
JournalJournal of Theoretical Probability
Issue number1
Publication statusPublished - Mar 1 2009


  • Local time
  • Strong theorems
  • Transient random walk

ASJC Scopus subject areas

  • Statistics and Probability
  • Mathematics(all)
  • Statistics, Probability and Uncertainty

Fingerprint Dive into the research topics of 'Transient nearest neighbor random walk on the line'. Together they form a unique fingerprint.

  • Cite this