Elephant random walk with polynomially decaying steps
Abstract
In this paper, we introduce a variation of the elephant random walk whose steps are polynomially decaying. At each time k, the walker's step size is k-γ with γ>0. We investigate effects of the step size exponent γ and the memory parameter α∈ [-1,1] on the long-time behavior of the walker. For fixed α, it admits phase transition from divergence to convergence (localization) at γc(α)= \α,1/2\. This means that large enough memory effect can shift the critical point for localization. Moreover, we obtain quantitative limit theorems which provide a detailed picture of the long-time behavior of the walker.
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.