On the number of cutpoints of the transient nearest neighbor random walk on the line
The authors consider transient nearest neighbor (NN) random walks on the nonnegative integers. The probability of going to the right from state \(i\) \((i\geq 1)\) is taken to be \({1\over 2}+ p_i\geq {1\over 2}\). A point \(R\) is called a cutpoint if the random walk makes exactly one upcrossing from \(R\) to \(R+1\). \(R\) is a strong cutpoint if it is visited exactly once by the NN random walk. The authors give criteria in terms of the \(p_i\)'s for the almost sure finiteness of the (random) sets of cut points and strong cut points, respectively examples, conjectures and open problems are presented as well.
- 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
- A transient Markov chain with finitely many cutpoints
- Cutpoints and Exchangeable Events for Random Walks
- scientific article; zbMATH DE number 1944008 (Why is no real title available?)
- scientific article; zbMATH DE number 4000257 (Why is no real title available?)
- scientific article; zbMATH DE number 3236503 (Why is no real title available?)
- scientific article; zbMATH DE number 3054859 (Why is no real title available?)
- Integrating Regularly Varying Functions with Exponent - 1
- Some intersection properties of random walk paths
- Transient nearest neighbor random walk on the line
- Extremum of a time-inhomogeneous branching random walk
- Cutoff phenomenon for nearest Lamperti's random walk
- On the transience and recurrence of Lamperti's random walk on Galton-Watson trees
- Cutpoints for simple random walks on quasi-transitive graphs
- Cutpoints of non-homogeneous random walks
- Minima of independent time-inhomogeneous 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 resistance of random walk paths
- Asymptotics of product of nonnegative 2-by-2 matrices with applications to random walks with asymptotically zero drifts
- On a maximum of some random walk on lattice of half line
- Most transient random walks have infinitely many cut times
- Cutpoints of (1,2) and (2,1) random walks on the lattice of positive half line
- Times of a branching process with immigration in varying environments attaining a fixed level
- Regeneration of branching processes with immigration in varying environments
- Local time, upcrossing time and weak cutpoints of a spatially inhomogeneous random walk on the line
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)
