Fluctuations of Discrete-Time Random Walks
Denis Denisov, Vitali Wachtel

TL;DR
This paper reviews various methods for analyzing fluctuations and first-passage times of one-dimensional discrete-time random walks, emphasizing the robustness of the universality approach over classical techniques.
Contribution
It introduces the universality approach to random walk fluctuations, highlighting its advantages and broader applicability compared to traditional methods like reflection principle and Wiener-Hopf factorisation.
Findings
Universality method is more robust than Wiener-Hopf.
Applicable to non-identically distributed or dependent increments.
Simplifies analysis by focusing on one-dimensional case.
Abstract
These notes are devoted to fluctuations of one-dimensional random walks. We discuss various approaches to first-passage times and to the corresponding conditional distributions. After discussion of some classical methods, such as reflection principle for simple random walks and Wiener-Hopf factorisation, we proceed to the universality approach, which has been developed in recent past. Considering one-dimensional case allows us to avoid some technical obstacles and to present the core of this method in a more transparent way. It turns out that the universality method is much more robust than the Wiener-Hopf factorisation and allows one to consider walks with non-identically distributed or even dependent increments.
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
TopicsDiffusion and Search Dynamics · stochastic dynamics and bifurcation · Quantum chaos and dynamical systems
