Sojourn time in $\mathbb{Z}^+$ for the Bernoulli random walk on $\mathbb{Z}$
Aim\'e Lachal

TL;DR
This paper investigates the distribution of the time a Bernoulli random walk spends in non-negative integers, providing simplified expressions for its probability distribution by modifying the sojourn time counting process.
Contribution
It introduces a modified sojourn time for Bernoulli walks that yields simpler probability distribution representations, extending previous symmetric case results.
Findings
Derived simpler formulas for the sojourn time distribution
Extended results beyond the symmetric case p=q=1/2
Connected discrete Bernoulli walk results to Le9vy's arcsine law
Abstract
Let be the classical Bernoulli random walk on the integer line with jump parameters and . The probability distribution of the sojourn time of the walk in the set of non-negative integers up to a fixed time is well-known, but its expression is not simple. By modifying slightly this sojourn time--through a particular counting process of the zeros of the walk as done by Chung & Feller ["On fluctuations in coin-tossings", Proc. Nat. Acad. Sci. U.S.A. 35 (1949), 605-608]-, simpler representations may be obtained for its probability distribution. In the aforementioned article, only the symmetric case () is considered. This is the discrete counterpart to the famous Paul L\'evy's arcsine law for Brownian motion.
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.
