On the number of cutpoints of the 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

4 Citations (Scopus)


We consider transient nearest neighbor random walks on the positive part of the real line. We give criteria for the finiteness of the number of cutpoints and strong cutpoints. Examples and open problems are presented.

Original languageEnglish
Pages (from-to)624-638
Number of pages15
JournalJournal of Theoretical Probability
Issue number2
Publication statusPublished - Jun 1 2010



  • Cutpoints
  • Strong theorems
  • Transient random walk

ASJC Scopus subject areas

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

Cite this