On the number of cutpoints of the transient nearest neighbor random walk on the line

2008/10/17 by Endre Csáki, Csáki, Endre, Antónia Földes +3
Computer Science · Mathematics · #60J10 60F15 60J55 #Bayesian Methods and Mixture Models #Data Management and Algorithms #FOS: Mathematics #Probability (math.PR) #Stochastic processes and statistical mechanics #math.PR #msc:60F15 #msc:60J10 #msc:60J55

paper · pdf · doi:10.48550/arxiv.0810.3123

17 pages

openalex publication_date 2008/10/17 · arxiv created 2008/12/17 · arxiv updated 2009/12/01 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/30

Abstract

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.

Related

• On the number of points skipped by a transient (1,2) random walk on the line
• Transient NN random walk on the line
• Cutpoints of (1,2) and (2,1) random walks on the lattice of positive half line
• Cutpoints for Random Walks on Quasi-Transitive Graphs
• Local time, upcrossing time and weak cutpoints of a spatially inhomogeneous random walk on the line