English
Related papers

Related papers: How two elephants can learn from each other

200 papers

Elephant random walk, introduced to study the effect of memory on random walks, is a novel type of walk that incorporates the information of one randomly chosen past step to determine the future step. However, memory of a process can be…

Probability · Mathematics 2025-09-15 Krishanu Maulik , Parthanil Roy , Tamojit Sadhukhan

We study the long time behavior of the elephant random walk with stops, introduced by Kumar, Harbola and Lindenberg (2010), and establish the phase transition of the number of visited points up to time $n$, and the correlation between the…

Probability · Mathematics 2025-03-25 Tatsuya Akimoto , Masato Takei , Keisuke Taniguchi

We consider a discrete-time random walk where the random increment at time step $t$ depends on the full history of the process. We calculate exactly the mean and variance of the position and discuss its dependence on the initial condition…

Statistical Mechanics · Physics 2009-11-10 Gunter M. Schütz , Steffen Trimper

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 Schuetz and Trimper in 2004, the next step always depends on the whole path so far.…

Probability · Mathematics 2021-10-27 Allan Gut , Ulrich Stadtmüller

We study a model of market economics wherein the $(n+1)$-st customer, for each $n\geqslant N$, with $N$ being a prespecified positive integer, draws a sample of (random) size $K_{n}$, either with replacement or without, from the customers…

Probability · Mathematics 2026-04-21 Sooraj M , Moumanti Podder , Archi Roy

When the memory parameter of the elephant random walk is above a critical threshold, the process becomes superdiffusive and, once suitably normalised, converges to a non-Gaussian random variable. In a recent paper by the three first…

Probability · Mathematics 2024-09-12 Hélène Guérin , Lucile Laulin , Kilian Raschel , Thomas Simon

One class of random walks with infinite memory, so called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We…

Statistical Mechanics · Physics 2016-03-23 Rüdiger Kürsten

In the classical simple random walk the steps are independent, viz., the walker has no memory. In contrast, in the elephant random walk which was introduced by Sch\"utz and Trimper in 2004, the walker remembers the whole past, and the next…

Probability · Mathematics 2023-06-22 Allan Gut , Ulrich Stadtmüller

We study the asymptotic behaviour of the number of times the elephant random walk in the critical regime visits the origin. Our result entails that most zeros of the critical elephant random walk occur shortly before its last passage time…

Probability · Mathematics 2024-10-10 Zheng Fang

We introduce a new random walk with unbounded memory obtained as a mixture of the Elephant Random Walk and the Dynamic Random Walk which we call the Dynamic Elephant Random Walk (DERW). As a consequence of this mixture the distribution of…

Probability · Mathematics 2021-02-04 Cristian F. Coletti , Lucas R. de Lima , Renato J. Gava , Denis A. Luiz

We prove functional central limit theorems for the dynamic elephant random walk in the $\sqrt{n}$ and $\sqrt{n\log n}$ orders, by applying the martingale convergence theorem and Karamata's theory of regular variation.

Probability · Mathematics 2025-07-03 Go Tokumitsu

The elephant random walk (ERW) is a microscopic, one-dimensional, discrete-time, non-Markovian random walk, which can lead to anomalous diffusion due to memory effects. In this study, I propose a multi-dimensional generalization in which…

Statistical Mechanics · Physics 2019-12-02 Vitor M. Marquioni

In this paper, we study a class of unbalanced step-reinforced random walks that unifies the elephant random walk, the positively step-reinforced random walk, and the negatively step-reinforced random walk. By establishing a connection with…

Probability · Mathematics 2025-10-14 Zhishui Hu , Liang Dong

We study the so-called elephant random walk (ERW) which is a non-Markovian discrete-time random walk on $\mathbb{Z}$ with unbounded memory which exhibits a phase transition from diffusive to superdiffusive behaviour. We prove a law of large…

Statistical Mechanics · Physics 2017-06-07 Cristian F. Coletti , Renato Gava , Gunter M. Schütz

In the simple random walk the steps are independent, whereas in the Elephant Random Walk (ERW), which was introduced by Sch\"utz and Trimper in 2004, the next step always depends on the whole path so far. In an earlier paper we investigated…

Probability · Mathematics 2020-05-20 Allan Gut , Ulrich Stadtmüller

In this paper, we introduce the elephant random walk (ERW) with memory consisting of randomly selected steps from its history. It is a time-changed variant of the standard elephant random walk with memory consisting of its full history. At…

Probability · Mathematics 2025-01-23 M. Dhillon , K. K. Kataria

We analyse large deviations of time-averaged quantities in stochastic processes with long-range memory, where the dynamics at time t depends itself on the value q_t of the time-averaged quantity. First we consider the elephant random walk…

Statistical Mechanics · Physics 2020-08-05 Robert L. Jack , Rosemary J. Harris

We study how memory impacts passages at the origin for a so-called elephant random walk in the diffusive regime. We observe that the number of zeros always grows asymptotically like the square root of the time, despite the fact that,…

Probability · Mathematics 2022-01-07 Jean Bertoin

The aim of this paper is to investigate the asymptotic behavior of the so-called elephant random walk with stops (ERWS). In contrast with the standard elephant random walk, the elephant is allowed to be lazy by staying on his own position.…

Probability · Mathematics 2022-09-07 Bernard Bercu

In the classic herding model, agents receive private signals about an underlying binary state of nature, and act sequentially to choose one of two possible actions, after observing the actions of their predecessors. We investigate what…

Computer Science and Game Theory · Computer Science 2018-02-21 Yu Cheng , Wade Hann-Caruthers , Omer Tamuz