Stationary switching random walks
Abstract
A switching random walk, commonly known under the misnomer `oscillating random walk', is a real-valued Markov chain whose distribution of increments is determined by the sign of the current position. We explicitly identify an invariant measure of this chain and study its uniqueness, up to a constant factor, within the class of locally finite invariant measures. Next we provide sufficient conditions for the topological recurrence of the switching random walk, and prove its topological irreducibility on a suitably chosen state space. As a consequence of our approach, we establish a new connection between the classical stationary distributions of the renewal theory and stationarity of the Lebesgue measure for random walks. We give further applications concerning reflected random walks and the waiting times in GI/G/1 queues with vacation.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.