Abstract
We present a combinatorial lemma that provides a new approach to the two-sided exit problem and related questions for left-continuous random walks (i.e., random walks on the integers whose negative steps have size − 1). Some applications to random walks on the circle are also derived.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have