On a class of random walks with reinforced memory
arXiv:1909.04633 · doi:10.1007/s10955-020-02602-3
Abstract
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 Schütz and Trimper [2004] with a stronger reinforcement mechanism, where, roughly speaking, a step from the past is remembered proportional to some weight and then repeated with probability . With probability , the random walk performs a step independent of the past. The weight of the remembered step is increased by an additive factor , making it likelier to repeat the step again in the future. A combination of techniques from the theory of urns, branching processes and -stable processes enables us to discuss the limit behavior of reinforced versions of both the Elephant Random Walk and its -stable counterpart, the so-called Shark Random Swim introduced by Businger [2018]. We establish phase transitions, separating subcritical from supercritical regimes.
arXiv comment38 pages, 1 figure
References in corpus (17)
- Emergence of scaling in random networks
- A survey of random processes with reinforcement
- Elephants can always remember: Exact long-range memory effects in a non-Markovian random walk
- Anomalous diffusion: A basic mechanism for the evolution of inhomogeneous systems
- Elephant Random Walks and their connection to Pólya-type urns
- A martingale approach for the elephant random walk
- Central Limit Theorem for the Elephant Random Walk
- Bayesian analysis for reversible Markov chains
- Random Recursive Trees and the Elephant Random Walk
- A strong invariance principle for the elephant random walk
- Exact moments in a continuous time random walk with complete memory of its history
- The Shark Random Swim (Lévy flight with memory)
- Variations of the elephant random walk
- Random walks with preferential relocations and fading memory: a study through random recursive trees
- Supercritical percolation on large scale-free random trees
- A random Schrödinger operator associated with the Vertex Reinforced Jump Process on infinite graphs
- A version of Herbert A. Simon's model with slowly fading memory and its connections to branching processes
Cited by in corpus (7)
- Functional limit theorems for the Multi-dimensional Elephant Random Walk
- Joint invariance principles for random walks with positively and negatively reinforced steps
- Multidimensional walks with random tendency
- Asymptotic Normality of Superdiffusive Step-Reinforced Random Walks
- Broadcasting induced colourings of random recursive trees and preferential attachment trees
- Limit theorems for a random walk with memory perturbed by a dynamical system
- Ulam's History-dependent Random Adding Process