On the number of cutpoints of the transient nearest neighbor random walk on the line
Csáki, Endre · Földes, Antónia · Révész, Pál
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.