Related papers: On the multidimensional elephant random walk with …
In the present paper, we introduce and analyze elephant random walks (ERWs) on bipartite periodic lattices arising as coverings of dipole graphs. We focus on lattices whose admissible step directions in the two parts of the bipartition are…
We focus on the study of dynamics of two kinds of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on two model networks: Cayley trees and ladder graphs. The stationary probability distribution for MERW is given…
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 introduce an original way to estimate the memory parameter of the elephant random walk, a fascinating discrete time random walk on integers having a complete memory of its entire history. Our estimator is nothing more than a…
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…
The aim of this paper is to deepen the analysis of the asymptotic behavior of the so-called minimal random walk (MRW) using a new martingale approach. The MRW is a discrete-time random walk with infinite memory that has three regimes…
In this article, we establish solid foundations for the study of Maximal Entropy Random Walks (MERWs) on infinite graphs. We introduce a generalized definition that extends the original concept, along with rigorous tools for handling this…
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…
We prove a conjecture by Bertoin that the multi-dimensional elephant random walk on $\mathbb{Z}^d$($d\geq 3$) is transient and the expected number of zeros is finite. We also provide some estimates on the rate of escape. In dimensions $d=…
We introduce a generalisation of Sch\"{u}tz and Trimper's elephant random walk to finitely generated groups. We focus on the simplest non-abelian setting, i.e. groups whose Cayley graphs are homogeneous trees of degree $d \ge 3$. We show…
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.…
The one-dimensional elephant random walk is a typical model of discrete-time random walk with step-reinforcement, and is introduced by Sch\"{u}tz and Trimper (2004). It has a parameter $\alpha \in (-1,1)$: The case $\alpha=0$ corresponds to…
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$,…
The Elephant Random Walk (ERW), first introduced by Sch\"utz and Trimper (2004), is a one-dimensional simple random walk on $ \mathbb{Z} $ having a memory about the whole past. We study the Shark Random Swim, a random walk whose steps are $…
We consider in this article an Elephant Random Walk evolving in the plane. Specifically, this is a reinforced stochastic process in which the $n$th step is given by a random rotation of one of the previous steps chosen uniformly at random.…
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 provide analytical solutions for two types of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on a Cayley tree with arbitrary branching number, root degree, and number of generations. For MERW, we obtain the…
We study the asymptotic behaviour of a version of the one-dimensional Mott random walk in a regime that exhibits severe blocking. We establish that, for any fixed time, the appropriately-rescaled Mott random walk is situated between two…
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…
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…