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 Gut and Stadtmüeller (2018). 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 Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call