Related papers: A martingale approach for the elephant random walk
The randomized play-the-winner rule (RPW) is a response-adaptive design proposed by Wei and Durham (1978) for sequentially randomizing patients to treatments in a two-treatment clinical trial so that more patients are assigned to the better…
We consider a non-Markovian discrete-time random walk on $\mathbb{Z}$ with unbounded memory called the elephant random walk (ERW). We prove a strong invariance principle for the ERW. More specifically, we prove that, under a suitable…
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 Sch\"utz and Trimper in 2004, the walker remembers the whole past, and the next…
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…
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…
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…
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,…
Elephant random walks were studied recently in \cite{mukherjee2025elephant} on the groups $\mathbb{Z}^{*d_1} * \mathbb{Z}_2^{*d_2}$ whose Cayley graphs are infinite $d$-regular trees with $d = 2d_1 + d_2$. It was found that for $d \ge 3$,…
Based on a martingale theory approach, we present a complete characterization of the asymptotic behaviour of a lazy reinforced random walk (LRRW) which shows three different regimes (diffusive, critical and superdiffusive). This allows us…
We consider a generalization of the so-called elephant random walk by introducing multiple elephants moving along the integer line, $\mathbb{Z}$. When taking a new step, each elephant considers not only its own previous steps but also the…
In this report, we introduce the elephant random walk on the triangular lattice over $R^2$ incorporating directions by extending the model developed in \cite{baur2016elephant}. We study the behavior of the walk by finding the appropriate…
We give criteria for ergodicity, transience and null recurrence for the random walk in random environment on {0,1,2,...}, with reflection at the origin, where the random environment is subject to a vanishing perturbation. Our results…
This paper investigates functional limit theorems for the Elephant Random Walk (ERW) on general periodic structures, extending the Bertenghi's results on $\mathbb{Z}^d$. Our results reveal new structure-dependent quantities that do not…
Elephant random walk is a kind of one-dimensional discrete-time random walk with infinite memory: For each step, with probability $\alpha$ the walker adopts one of his/her previous steps uniformly chosen at random, and otherwise he/she…
We continue our study of the unidirectional elephant random walk (uERW) initiated in {\it {Electron. Commun. Probab.}} ({\bf 29} 2024, article no. 78). In this paper we obtain definitive results when the memory exponent $\beta\in (-1,…
We study the limiting behaviors of a generalized elephant random walk on the integer lattice. This random walk is defined by using two sequences of parameters expressing the memory at each step from the whole past and the drift of each step…
We study how conditioning affects the long-term behavior of the Elephant Random Walk, focusing on its first return to the origin, namely, the time it takes to forget the training. When the walker is conditioned to be at position $n$ at time…
This paper investigates whether two independent Elephant Random Walks (ERWs) on $\mathbb{Z}$, each with a different memory parameter, can meet infinitely often, extending the work of Roy, Takei, and Tanemura. We also study the asymptotic…
We explore the impact of long-range memory on the properties of a family of quantum walks in a one-dimensional lattice and discrete time, which can be understood as the quantum version of the classical "Elephant Random Walk" non-Markovian…
In this paper, we introduce a variation of the elephant random walk whose steps are polynomially decaying. At each time $k$, the walker's step size is $k^{-\gamma}$ with $\gamma>0$. We investigate effects of the step size exponent $\gamma$…