IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v189y2022ics0167715222001432.html
   My bibliography  Save this article

The elephant random walk with gradually increasing memory

Author

Listed:
  • Gut, Allan
  • Stadtmüller, Ulrich

Abstract

In the simple random walk the steps are independent, viz., the walker has no memory. In contrast, in the elephant random walk (ERW), which was introduced by Schütz and Trimper (2004), the next step always depends on the whole path so far. Various authors have studied further properties of the ERW. In Gut and Stadtmüller (2021b) we studied the case when the Elephant remembers only a finite part of the first or last steps. In both cases there was no separation into two different regimes as in the classical ERW. We also posed the question about what happens if she remembers a gradually increasing past. This paper will give some answers to that question. We also discuss related questions for ERW:s with delays.

Suggested Citation

  • Gut, Allan & Stadtmüller, Ulrich, 2022. "The elephant random walk with gradually increasing memory," Statistics & Probability Letters, Elsevier, vol. 189(C).
  • Handle: RePEc:eee:stapro:v:189:y:2022:i:c:s0167715222001432
    DOI: 10.1016/j.spl.2022.109598
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715222001432
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spl.2022.109598?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. C.C. Heyde, 2004. "Asymptotics and Criticality for a Correlated Bernoulli Process," Australian & New Zealand Journal of Statistics, Australian Statistical Publishing Association Inc., vol. 46(1), pages 53-57, March.
    2. James, Barry & James, Kang & Qi, Yongcheng, 2008. "Limit theorems for correlated Bernoulli random variables," Statistics & Probability Letters, Elsevier, vol. 78(15), pages 2339-2345, October.
    3. Gut, Allan & Stadtmüller, Ulrich, 2021. "The number of zeros in Elephant random walks with delays," Statistics & Probability Letters, Elsevier, vol. 174(C).
    4. Moura, Thiago R.S. & Viswanathan, G.M. & da Silva, M.A.A. & Cressoni, J.C. & da Silva, L.R., 2016. "Transient superdiffusion in random walks with a q-exponentially decaying memory profile," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 453(C), pages 259-263.
    5. da Silva, M.A.A. & Cressoni, J.C. & Viswanathan, G.M., 2006. "Discrete-time non-Markovian random walks: The effect of memory limitations on scaling," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 364(C), pages 70-78.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gava, Renato J. & Rezende, Bruna L.F., 2021. "Some limit theorems for dependent Bernoulli random variables," Statistics & Probability Letters, Elsevier, vol. 170(C).
    2. Zhang, Li-Xin & Zhang, Yang, 2015. "Asymptotics for a class of dependent random variables," Statistics & Probability Letters, Elsevier, vol. 105(C), pages 47-56.
    3. Zhang, Yang & Zhang, Li-Xin, 2015. "On the almost sure invariance principle for dependent Bernoulli random variables," Statistics & Probability Letters, Elsevier, vol. 107(C), pages 264-271.
    4. Wu, Lan & Qi, Yongcheng & Yang, Jingping, 2012. "Asymptotics for dependent Bernoulli random variables," Statistics & Probability Letters, Elsevier, vol. 82(3), pages 455-463.
    5. Damgaard, Christian, 2008. "Modelling pin-point plant cover data along an environmental gradient," Ecological Modelling, Elsevier, vol. 214(2), pages 404-410.
    6. Alessandro Arlotto & Noah Gans & J. Michael Steele, 2014. "Markov Decision Problems Where Means Bound Variances," Operations Research, INFORMS, vol. 62(4), pages 864-875, August.
    7. Jing Dong & Rouba Ibrahimb, 2020. "Managing Supply in the On-Demand Economy: Flexible Workers, Full-Time Employees, or Both?," Operations Research, INFORMS, vol. 68(4), pages 1238-1264, July.
    8. Modarres, Reza, 2011. "High-dimensional generation of Bernoulli random vectors," Statistics & Probability Letters, Elsevier, vol. 81(8), pages 1136-1142, August.
    9. Moura, Thiago R.S. & Viswanathan, G.M. & da Silva, M.A.A. & Cressoni, J.C. & da Silva, L.R., 2016. "Transient superdiffusion in random walks with a q-exponentially decaying memory profile," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 453(C), pages 259-263.
    10. Bhowal, Sanchayan & Samanta, Ramkrishna Jyoti & Ray, Arnob & Bhattacharyya, Sirshendu & Hens, Chittaranjan, 2023. "Exploring the potential of collective learning to reduce foraging time," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    11. James, Barry & James, Kang & Qi, Yongcheng, 2008. "Limit theorems for correlated Bernoulli random variables," Statistics & Probability Letters, Elsevier, vol. 78(15), pages 2339-2345, October.
    12. de Lacerda, K.J.C.C. & da Silva, L.R. & Viswanathan, G.M. & Cressoni, J.C. & da Silva, M.A.A., 2022. "A random walk model with a mixed memory profile: Exponential and rectangular profile," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 597(C).
    13. Peter Farkas & Laszlo Matyas, 2015. "Testing for Unit Roots in Panel Data with Boundary Crossing Counts," CEU Working Papers 2015_5, Department of Economics, Central European University, revised 03 Nov 2015.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:189:y:2022:i:c:s0167715222001432. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.