On the number of points skipped by a transient (1,2) random walk on the line

2017/07/20 by Huaming Wang, Wang, Hua-Ming
Computer Science · Mathematics · #Computational Geometry and Mesh Generation #Data Management and Algorithms #FOS: Mathematics #Primary 60G50 #Probability (math.PR) #Secondary 60J10 #Stochastic processes and statistical mechanics

paper · pdf · doi:10.48550/arxiv.1707.06423

openalex publication_date 2017/07/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Consider a transient near-critical (1,2) random walk on the positive half line. We give a criteria for the finiteness of the number of the skipped points (the points never visited) by the random walk. This result generalizes (partially) the criteria for the finiteness of the number of cutpoingts of the nearest neighbor random walk on the line by Csáki, Földers, Révész [J Theor Probab (2010) 23: 624-638].

Related

• On the number of cutpoints of the transient nearest neighbor random walk on the line
• Cutpoints of (1,2) and (2,1) random walks on the lattice of positive half line
• Local time, upcrossing time and weak cutpoints of a spatially inhomogeneous random walk on the line
• Cutpoints for Random Walks on Quasi-Transitive Graphs
• Critical RWRE on trees and tree-indexed random walks