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.60074OpenAlexW1973026902MaRDI QIDQ975323FDOQ975323
Authors: Endre Csáki, Antónia Földes, Pál Révész 
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
- Cutpoints of non-homogeneous random walks
- On the number of points skipped by a transient \((1,2)\) random walk on the lattice of the positive half line
- Cutpoints and Exchangeable Events for Random Walks
- A transient Markov chain with finitely many cutpoints
- Transient nearest neighbor random walk on the line
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Strong limit theorems (60F15) Local time and additive functionals (60J55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A transient Markov chain with finitely many cutpoints
- Cutpoints and Exchangeable Events for Random Walks
- Some intersection properties of random walk paths
- Transient nearest neighbor random walk on the line
- Title not available (Why is that?)
- Integrating Regularly Varying Functions with Exponent $ - 1$
Cited In (12)
- Cutpoints and resistance of random walk paths
- Cutpoints of non-homogeneous random walks
- Most transient random walks have infinitely many cut times
- On a maximum of some random walk on lattice of half line
- On the transience and recurrence of Lamperti's random walk on Galton-Watson trees
- On the number of points skipped by a transient \((1,2)\) random walk on the lattice of the positive half line
- Cutoff phenomenon for nearest Lamperti's random walk
- Extremum of a time-inhomogeneous branching random walk
- Cutpoints of (1,2) and (2,1) random walks on the lattice of positive half line
- Cutpoints for simple random walks on quasi-transitive graphs
- Minima of independent time-inhomogeneous random walks
- Asymptotics of product of nonnegative 2-by-2 matrices with applications to random walks with asymptotically zero drifts
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)
