On the number of cutpoints of the transient nearest neighbor random walk on the line
Endre Cs\'aki, Ant\'onia F\"oldes, P\'al R\'ev\'esz
TL;DR
This paper investigates the conditions under which the number of cutpoints and strong cutpoints in transient nearest neighbor random walks on the positive real line is finite, providing criteria, examples, and open problems.
Contribution
It introduces new criteria for the finiteness of cutpoints and strong cutpoints in such random walks, advancing understanding of their structural properties.
Findings
Criteria for finiteness of cutpoints
Criteria for finiteness of strong cutpoints
Examples illustrating the criteria
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Data Management and Algorithms · Bayesian Methods and Mixture Models