Finite-memory elephant random walk and the central limit theorem for additive functionals
From MaRDI portal
Publication:2233657
Abstract: The Central Limit Theorem (CLT) for additive functionals of Markov chains is a well known result with a long history. In this paper we present applications to two finite-memory versions of the Elephant Random Walk, solving a problem from arXiv:1812.01915. We also present a derivation of the CLT for additive functionals of finite state Markov chains, which is based on positive recurrence, the CLT for IID sequences and some elementary linear algebra, and which focuses on characterization of the variance.
Recommendations
Cites work
- A martingale approach for the elephant random walk
- Central limit theorem and related results for the elephant random walk
- Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions
- Central limit theorem started at a point for stationary processes and additive functionals of reversible Markov chains
- Central limit theorems for additive functionals of Markov chains.
- Markov chains and stochastic stability
- Matrix iterative analysis
- Probability theory
- Probability: a graduate course
Cited in
(2)
This page was built for publication: Finite-memory elephant random walk and the central limit theorem for additive functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233657)