Elephant random walks with multiple extractions and general reinforcement functions
arXiv:2507.14626 · doi:10.1007/s10959-025-01471-4
Abstract
We consider a generalized model of elephant random walks wherein the walker, during the -st time-stamp, draws from the past (i.e. the set ) a sample of time-stamps, either with replacement or without, where may either remain fixed as grows, or may grow with . Letting denote the time-stamps sampled, the step taken by the walker during the -st time-stamp, denoted , is a -valued random variable whose distribution depends on the proportion of -valued steps out of via a reinforcement function . In this paper, we investigate the asymptotic behaviour, i.e. strong and weak convergence, of this random walk model under suitable assumptions made on the function (as well as on the sequence when the sample size varies with ).
References in corpus (14)
- Elephants can always remember: Exact long-range memory effects in a non-Markovian random walk
- Elephant Random Walks and their connection to Pólya-type urns
- A martingale approach for the elephant random walk
- Memory-induced anomalous dynamics: emergence of diffusion, subdiffusion, and superdiffusion from a single random walk model
- Central Limit Theorem for the Elephant Random Walk
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- Solvable random walk model with memory and its relations with Markovian models of anomalous diffusion
- Random walkers with extreme value memory: modelling the peak-end rule
- On the elephant random walk with stops playing hide and seek with the Mittag-Leffler distribution
- Large deviations for Generalized Polya Urns with arbitrary urn function
- Large Deviations Theory of Increasing Returns
- Stochastic Approximation with Random Step Sizes and Urn Models with Random Replacement Matrices Having Finite Mean
- Multi-Dimensional Elephant Random Walk with Coupled Memory
- Almost Sure Convergence of Randomized Urn Models with Application to Elephant Random Walk