Translator Disclaimer
May 2021 Finite-memory elephant random walk and the central limit theorem for additive functionals
Iddo Ben-Ari, Jonah Green, Taylor Meredith, Hugo Panzo, Xioran Tan
Author Affiliations +
Braz. J. Probab. Stat. 35(2): 242-262 (May 2021). DOI: 10.1214/20-BJPS475

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.

Acknowledgments

Research performed during Markov Chains REU, partially supported by NSA grant H98230-19-1-0022 to Iddo Ben-Ari. The fourth author was supported at the Technion by a Zuckerman Fellowship.

Citation

Download Citation

Iddo Ben-Ari. Jonah Green. Taylor Meredith. Hugo Panzo. Xioran Tan. "Finite-memory elephant random walk and the central limit theorem for additive functionals." Braz. J. Probab. Stat. 35 (2) 242 - 262, May 2021. https://doi.org/10.1214/20-BJPS475

Information

Received: 1 January 2020; Accepted: 1 April 2020; Published: May 2021
First available in Project Euclid: 24 March 2021

Digital Object Identifier: 10.1214/20-BJPS475

Rights: Copyright © 2021 Brazilian Statistical Association

JOURNAL ARTICLE
21 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.35 • No. 2 • May 2021
Back to Top