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

Simple item page
dc.creatorCsáki, Endre
dc.creatorFöldes, Antónia
dc.creatorRévész, Pál
dc.date2008-10-17
dc.date2008-12-17
dc.date.accessioned2026-07-07T12:13:17Z
dc.date.available2026-07-07T12:13:17Z
dc.descriptionWe 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.
dc.description17 pages
dc.identifierhttps://arxiv.org/abs/0810.3123
dc.identifierhttp://arxiv.org/abs/0810.3123
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/210797
dc.subjectProbability
dc.subject60J10 60F15 60J55
dc.titleOn the number of cutpoints of the transient nearest neighbor random walk on the line
dc.typetext

Files

Collections

arXiv