On a Class of Random Walks with Reinforced Memory

被引:12
|
作者
Baur, Erich [1 ]
机构
[1] Bern Univ Appl Sci, Bern, Switzerland
关键词
Reinforced random walks; Preferential attachment; Memory; Stable processes; Branching processes; Polya urns;
D O I
10.1007/s10955-020-02602-3
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
This paper deals with different models of random walks with a reinforced memory of preferential attachment type. We consider extensions of the Elephant Random Walk introduced by Schutz and Trimper (Phys Rev E 70:044510(R), 2004) with stronger reinforcement mechanisms, where, roughly speaking, a step from the past is remembered proportional to some weight and then repeated with probability p. With probability 1 - p, the random walk performs a step independent of the past. The weight of the remembered step is increased by an additive factor b >= 0, making it likelier to repeat the step again in the future. A combination of techniques from the theory of urns, branching processes and alpha-stable processes enables us to discuss the limit behavior of reinforced versions of both the Elephant Random Walk and its alpha-stable counterpart, the so-called Shark Random Swim introduced by Businger (J Stat Phys 172(3):701-717, 2004). We establish phase transitions, separating subcritical from supercritical regimes.
引用
收藏
页码:772 / 802
页数:31
相关论文
共 50 条
  • [31] Crossings States and Sets of States in Random Walks
    Vyacheslav M. Abramov
    Methodology and Computing in Applied Probability, 2023, 25
  • [32] Classes of random walks on temporal networks with competing timescales
    Petit, Julien
    Lambiotte, Renaud
    Carletti, Timoteo
    APPLIED NETWORK SCIENCE, 2019, 4 (01)
  • [33] Classes of random walks on temporal networks with competing timescales
    Julien Petit
    Renaud Lambiotte
    Timoteo Carletti
    Applied Network Science, 4
  • [34] Integrability of exit times and ballisticity for random walks in Dirichlet environment
    Tournier, Laurent
    ELECTRONIC JOURNAL OF PROBABILITY, 2009, 14 : 431 - 451
  • [35] Random Walks on Semantic Networks Can Resemble Optimal Foraging
    Abbott, Joshua T.
    Austerweil, Joseph L.
    Griffiths, Thomas L.
    PSYCHOLOGICAL REVIEW, 2015, 122 (03) : 558 - 569
  • [36] Anderson-like localization transition of random walks with resetting
    Boyer, Denis
    Falcon-Cortes, Andrea
    Giuggioli, Luca
    Majumdar, Satya N.
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2019,
  • [37] Elephant random walks and their connection to Polya-type urns
    Baur, Erich
    Bertoin, Jean
    PHYSICAL REVIEW E, 2016, 94 (05)
  • [38] DIFFUSION SCALING IN EVENT-DRIVEN RANDOM WALKS: AN APPLICATION TO TURBULENCE
    Paradisi, P.
    Cesari, R.
    Donateo, A.
    Contini, D.
    Allegrini, P.
    REPORTS ON MATHEMATICAL PHYSICS, 2012, 70 (02) : 205 - 220
  • [39] Random Walks with Preferential Relocations to Places Visited in the Past and their Application to Biology
    Boyer, Denis
    Solis-Salas, Citlali
    PHYSICAL REVIEW LETTERS, 2014, 112 (24)
  • [40] Random walks conditioned to stay nonnegative and branching processes in an unfavourable environment
    Vatutin, Vladimir A.
    Dong, Congzao
    Dyakonova, Elena E.
    SBORNIK MATHEMATICS, 2023, 214 (11) : 1501 - 1533