Hostname: page-component-89b8bd64d-shngb Total loading time: 0 Render date: 2026-05-07T01:03:26.944Z Has data issue: false hasContentIssue false

The elephant random walk in the triangular array setting

Published online by Cambridge University Press:  16 January 2025

Rahul Roy*
Affiliation:
Indian Statistical Institute and Indraprastha Institute of Information Technology, Delhi
Masato Takei*
Affiliation:
Yokohama National University
Hideki Tanemura*
Affiliation:
Keio University
*
*Postal address: 7 SJS Sansanwal Marg, New Delhi 110016, India. Email: rahul@isid.ac.in
**Postal address: 79-5 Tokiwadai, Hodogaya-ku, Yokohama 240-8501, Japan. Email: takei-masato-fx@ynu.ac.jp
***Postal address: 3-14-1 Hiyoshi, Kohoku-ku, Yokohama, 223-8522, Japan. Email: tanemura@math.keio.ac.jp

Abstract

Gut and Stadmüller (2021, 2022) initiated the study of the elephant random walk with limited memory. Aguech and El Machkouri (2024) published a paper in which they discuss an extension of the results by Gut and Stadtmüller (2022) for an ‘increasing memory’ version of the elephant random walk without stops. Here we present a formal definition of the process that was hinted at by Gut and Stadtmüller. This definition is based on the triangular array setting. We give a positive answer to the open problem in Gut and Stadtmüller (2022) for the elephant random walk, possibly with stops. We also obtain the central limit theorem for the supercritical case of this model.

Information

Type
Original Article
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of Applied Probability Trust

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable