Limit theorem for reflected random walks

Abstract

Let n , n ∈ N be a sequence of i.i.d. random variables with values in Z. The associated random walk on Z is S(n) = 1 + × × × + n+1 and the corresponding "reflected walk" on N 0 is the Markov chain X(n), n ∈ N, given by X(0) = x ∈ N 0 and X(n + 1) = |X(n) + n+1 | for n 0. It is well know that the reflected walk (X(n)) n0 is null-recurrent when the n are square integrable and centered. In this paper, we prove that the process (X(n)) n0 , properly rescaled, converges in distribution towards the reflected Brownian motion on R + , when E[ 2 n ] < +∞, E[(max(0, -- n) 3 ] < +∞ and the n are aperiodic and centered.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…