Finite-memory elephant random walk and the central limit theorem for additive functionals

From MaRDI portal
Publication:2233657

DOI10.1214/20-BJPS475zbMATH Open1471.60108arXiv1911.05716OpenAlexW3154748779MaRDI QIDQ2233657FDOQ2233657


Authors: Iddo Ben-Ari, Jonah Green, Taylor Meredith, Hugo Panzo, Xioran Tan Edit this on Wikidata


Publication date: 11 October 2021

Published in: Brazilian Journal of Probability and Statistics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1911.05716




Recommendations




Cites Work


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)