Optimal Rates in Local and Central Limit Theorems for the Elephant Random Walk

We determine the optimal rates of convergence in the local and central limit theorems for the one-dimensional elephant random walk in the diffusive and critical regimes, $0\le p\le3/4$. For every fixed initial distribution, we treat both exact finite-time centering and standardization and the normalization $S_n/\sqrt n$ (or $S_n/\sqrt{n\log n}$ at criticality). We establish uniform Edgeworth expansions for local probabilities and distribution functions, and use these expansions to derive the optimal convergence rates, which exhibit several phase transitions depending on the symmetry of the initial distribution, the normalization, and the type of approximation. Our approach uses elephant polynomials for precise characteristic-function expansions and a random recursive tree representation for global Fourier bounds.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-26
DOI
https://doi.org/10.48550/arxiv.2610.35019
Primary Topic
Stochastic processes and statistical mechanics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Optimal Rates in Local and Central Limit Theorems for the Elephant Random Walk

Hideki Murahara, Go Tokumitsu
arXiv (Cornell University)
Stochastic processes and statistical mechanics
preprint

Optimal Rates in Local and Central Limit Theorems for the Elephant Random Walk

Hideki Murahara, Go Tokumitsu
preprint en

Abstract

We determine the optimal rates of convergence in the local and central limit theorems for the one-dimensional elephant random walk in the diffusive and critical regimes, $0\le p\le3/4$. For every fixed initial distribution, we treat both exact finite-time centering and standardization and the normalization $S_n/\sqrt n$ (or $S_n/\sqrt{n\log n}$ at criticality). We establish uniform Edgeworth expansions for local probabilities and distribution functions, and use these expansions to derive the optimal convergence rates, which exhibit several phase transitions depending on the symmetry of the initial distribution, the normalization, and the type of approximation. Our approach uses elephant polynomials for precise characteristic-function expansions and a random recursive tree representation for global Fourier bounds.

arXiv (Cornell University)
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon