Cutpoints of (1,2) and (2,1) random walks on the lattice of positive half line

From MaRDI portal
Publication:6204787

DOI10.1007/S10959-023-01293-2arXiv2206.09402OpenAlexW4387609233MaRDI QIDQ6204787FDOQ6204787

Lanlan Tang, Huaming Wang

Publication date: 2 April 2024

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

Abstract: In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site n are asymptotically constants as nightarrowinfty. For (1,2) random walk, we get some elaborate asymptotic behaviours of various escape probabilities and hitting probabilities of the walk. Such observations and some delicate analysis of continued fractions and the product of nonnegative matrices enable us to give criteria for finiteness of the number of cutpoints of both (1,2) and (2,1) random walks, which generalize E. Cs'aki, A. F"oldes and P. R'ev'esz [J. Theor. Probab. 23: 624-638 (2010)] and H.-M. Wang [Markov Processes Relat. Fields 25: 125-148 (2019)]. For near-recurrent random walks, whenever there are infinitely many cutpoints, we also study the asymptotics of the number of cutpoints in [0,n].


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







Cites Work






This page was built for publication: Cutpoints of (1,2) and (2,1) random walks on the lattice of positive half line

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