Introducing smooth amnesia to the memory of the elephant random walk. (English) Zbl 1500.60019

Summary: This paper is devoted to the asymptotic analysis of the amnesic elephant random walk (AERW) using a martingale approach. More precisely, our analysis relies on asymptotic results for multidimensional martingales with matrix normalization. In the diffusive and critical regimes, we establish the almost sure convergence and the quadratic strong law for the position of the AERW. The law of iterated logarithm is given in the critical regime. The distributional convergences of the AERW to Gaussian processes are also provided. In the superdiffusive regime, we prove the distributional convergence as well as the mean square convergence of the AERW.


60F17 Functional limit theorems; invariance principles
60G42 Martingales with discrete parameter
60G50 Sums of independent random variables; random walks
Full Text: DOI arXiv


[1] Erich Baur and Jean Bertoin, Elephant random walks and their connection to pólya-type urns., Physical review. E 94, 052134 (2016).
[2] Erich Baur, On a class of random walks with reinforced memory, J. Stat. Phys. (2020). · Zbl 1458.60050
[3] Bernard Bercu, A martingale approach for the elephant random walk, J. Phys. A 51 (2018), no. 1, 015201, 16. · Zbl 1392.60038
[4] Bernard Bercu, On the elephant random walk with stops playing hide and seek with the Mittag-Leffler distribution, 2112.10405 (2022). · Zbl 1503.60053
[5] Bernard Bercu and Víctor Hugo Vázquez Guevara, New insights on the minimal random walk, 2112.09321 (2021).
[6] Bernard Bercu and Lucile Laulin, On the multi-dimensional elephant random walk, J. Stat. Phys. 175 (2019), no. 6, 1146-1163. · Zbl 1421.62116
[7] Bernard Bercu and Lucile Laulin, On the center of mass of the elephant random walk, Stochastic Process. Appl. 133 (2021), 111-128. · Zbl 1469.60135
[8] Marco Bertenghi, Functional limit theorems for the multi-dimensional elephant random walk, Stochastic Models 38 (2022), no. 1, 37-50. · Zbl 1490.60105
[9] Silvia Businger, The shark random swim (Lévy flight with memory), J. Stat. Phys. 172 (2018), no. 3, 701-717. · Zbl 1400.82097
[10] Cristian F. Coletti, Renato Gava, and Gunter M. Schütz, Central limit theorem and related results for the elephant random walk, J. Math. Phys. 58 (2017), no. 5, 053303, 8. · Zbl 1375.60086
[11] Marie Duflo, Random iterative models, Applications of Mathematics (New York), vol. 34, Springer-Verlag, Berlin, 1997. · Zbl 0868.62069
[12] Allan Gut and Ulrich Stadtmüller, The number of zeros in elephant random walks with delays, Statist. Probab. Lett. 174 (2021), Paper No. 109112, 9. · Zbl 1478.60089
[13] Allan Gut and Ulrich Stadtmüller, The elephant random walk with gradually increasing memory, Statistics & Probability Letters 189 (2022), 109598. · Zbl 1496.60020
[14] Allan Gut and Ulrich Stadtmüller, Variations of the elephant random walk, J. Appl. Probab. 58 (2021), no. 3, 805-829. · Zbl 1479.60049
[15] Naoki Kubota and Masato Takei, Gaussian fluctuation for superdiffusive elephant random walks, J. Stat. Phys. 177 (2019), no. 6, 1157-1171. · Zbl 1439.60043
[16] Rüdiger Kürsten, Random recursive trees and the elephant random walk, Physical Review E 93, 032111 (2016).
[17] Lucile Laulin, New Insights on the Reinforced Elephant Random Walk Using a Martingale Approach, Journal of Statistical Physics 186 (2021).
[18] Tatsuya Miyazaki and Masato Takei, Limit theorems for the ‘laziest’ minimal random walk model of elephant type, J. Stat. Phys. 181 (2020), no. 2, 587-602. · Zbl 1460.60036
[19] Gunter M. Schütz and Steffen Trimper, Elephants can always remember: Exact long-range memory effects in a non-markovian random walk., Physical review. E 70, 045101 (2004).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.