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

From MaRDI portal
Publication:975323

DOI10.1007/S10959-008-0204-4zbMATH Open1201.60074arXiv0810.3123OpenAlexW1973026902MaRDI QIDQ975323FDOQ975323


Authors: Endre Csáki, Antónia Földes, Pál Révész Edit this on Wikidata


Publication date: 9 June 2010

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0810.3123




Recommendations




Cites Work


Cited In (10)





This page was built for publication: On the number of cutpoints of the transient nearest neighbor random walk on the line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975323)