相关论文: Elephant Random Walks and their connection to P\'o…

In this article we shall derive functional limit theorems for the multi-dimensional elephant random walk (MERW) and thus extend the results provided for the one-dimensional marginal by Bercu and Laulin (2019). The MERW is a non-Markovian…

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.…

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 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…

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 $…

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…

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…

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…

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…

The purpose of this paper is to establish, via a martingale approach, some refinements on the asymptotic behavior of the one-dimensional elephant random walk (ERW). The asymptotic behavior of the ERW mainly depends on a memory parameter $p$…

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…

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\"utz and Trimper [2004] with a stronger reinforcement…

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…

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…

Gut and Stadm\"{u}ller (2021, 2022) initiated the study of the elephant random walk with limited memory. Aguech and El Machkouri (2024) published a paper in which they discuss an extension of results by Gut and Stadtm\"{u}ller (2022) for an…

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…

Consider a generalized Elephant Random Walk in which the step is chosen by selecting $k$ previous steps with $k$ odd and then going in the majority direction with a probability $p$ and in the opposite direction otherwise. In the $k=1$ case…

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…

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 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…