Cutoff Phenomenon for Nearest Lamperti’s Random Walk
Wenming Hong () and
Hui Yang ()
Additional contact information
Wenming Hong: Beijing Normal University
Hui Yang: Minzu University of China
Methodology and Computing in Applied Probability, 2019, vol. 21, issue 4, 1215-1228
Abstract:
Abstract We consider transient neighbor random walks on the positive part of the real line, the transition probability is state dependent being a special case of the Lamperti’s random walk. We show that a sequence of lazy random walks on [0, n] exhibits cutoff phenomenon. As an important step in the proof, we derive the limit speed of the expectation and variance of the hitting times of the random walk exactly. And as a byproduct, we give a probabilistic proof for the law of large numbers of the random walk which has been obtained by Voit (1992) using the method of polynomial hypergroups.
Keywords: Lamperti’s random walk; Cutoff; Hitting times; Law of large numbers; Branching structure within the random walk; Primary 60J80; Secondary 60G50 (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s11009-018-9666-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:21:y:2019:i:4:d:10.1007_s11009-018-9666-8
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009
DOI: 10.1007/s11009-018-9666-8
Access Statistics for this article
Methodology and Computing in Applied Probability is currently edited by Joseph Glaz
More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().