IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v200y2026ics0304414926001584.html

On a class of unbalanced step-reinforced random walks

Author

Listed:
  • Aguech, R.
  • Ben Hariz, S.
  • El Machkouri, M.
  • Faouzi, Y.

Abstract

A step-reinforced random walk is a discrete-time stochastic process with long-range dependence. At each step, with a fixed probability α, the so-called positively step-reinforced random walk repeats one of its previous steps, chosen randomly and uniformly from its entire history. Alternatively, with probability 1−α, it makes an independent move. For the so-called negatively step-reinforced random walk, the process is similar, but any repeated step is taken with its direction reversed. These random walks have been introduced respectively by Simon (1955) and Bertoin (2024) and are sometimes refered to the self-confident step-reinforced random walk and the counterbalanced step-reinforced random walk respectively. In this work, we introduce a new class of unbalanced step-reinforced random walks for which we prove the strong law of large numbers and the central limit theorem. In particular, our work provides a unified treatment of the elephant random walk introduced by Schutz and Trimper (2004) and the positively and negatively step-reinforced random walks.

Suggested Citation

  • Aguech, R. & Ben Hariz, S. & El Machkouri, M. & Faouzi, Y., 2026. "On a class of unbalanced step-reinforced random walks," Stochastic Processes and their Applications, Elsevier, vol. 200(C).
  • Handle: RePEc:eee:spapps:v:200:y:2026:i:c:s0304414926001584
    DOI: 10.1016/j.spa.2026.105026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414926001584
    Download Restriction: Full text may be restricted for ScienceDirect subscribers

    File URL: https://libkey.io/10.1016/j.spa.2026.105026?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Gut, Allan & Stadtmüller, Ulrich, 2022. "The elephant random walk with gradually increasing memory," Statistics & Probability Letters, Elsevier, vol. 189(C).
    2. Hu, Zhishui & Zhang, Yiting, 2024. "Strong limit theorems for step-reinforced random walks," Stochastic Processes and their Applications, Elsevier, vol. 178(C).
    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. Hu, Zhishui & Wang, Wei & Dong, Liang, 2025. "Strong approximations in the almost sure central limit theorem and limit behavior of the center of mass," Stochastic Processes and their Applications, Elsevier, vol. 182(C).
    2. Huang, Xulan & Fan, Xiequan & Xiang, Kainan, 2026. "Non-uniform Berry-Esseen bounds for the elephant random walk with random step sizes," Stochastic Processes and their Applications, Elsevier, vol. 200(C).
    3. Moumanti Podder & Archi Roy, 2026. "Elephant Random Walks with Multiple Extractions and General Reinforcement Functions," Journal of Theoretical Probability, Springer, vol. 39(1), pages 1-40, March.
    4. Rahul Roy & Masato Takei & Hideki Tanemura, 2026. "Elephant random walk with varying memory," Indian Journal of Pure and Applied Mathematics, Springer, vol. 57(1), pages 215-233, February.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:spapps:v:200:y:2026:i:c:s0304414926001584. 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/505572/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.