On the number of cutpoints of the transient nearest neighbor random walk on the line
classification
🧮 math.PR
keywords
cutpointslinenearestneighbornumberrandomtransientconsider
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.