Related papers: Elephant Random Walk with multiple extractions

In a recent paper [2] the author introduced and investigated a random walk model similar to a model introduced in [1]. In these models the increment of the random walk depends on the complete past of the process. In this note I will point…

In this paper, we provide an application to the random distance-$t$ walk in finite planes and derive asymptotic formulas (as $q \to \infty$) for the probability of return to start point after $\ell$ steps based on the "vertical"…

We study a non-Markovian random walk in dimension 1. It depends on two parameters eps_r and eps_l, the probabilities to go straight on when walking to the right, respectively to the left. The position x of the walk after n steps and the…

Fix integers $d \geq 2$ and $k\geq d-1$. Consider a random walk $X_0, X_1, \ldots$ in $\mathbb{R}^d$ in which, given $X_0, X_1, \ldots, X_n$ ($n \geq k$), the next step $X_{n+1}$ is uniformly distributed on the unit ball centred at $X_n$,…

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…

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

For a generalized step reinforced random walk, starting from the origin, the first step is taken according to the first element of an innovation sequence. Then in subsequent epochs, it recalls a past epoch with probability proportional to a…

We present a simple model of a random walk with partial memory, which we call the \emph{random memory walk}. We introduce this model motivated by the belief that it mimics the behavior of the once-reinforced random walk in high dimensions…

We show that two independent elephant random walks on the integer lattice $\mathbb{Z}$ meet each other finitely often or infinitely often depends on whether the memory parameter $p$ is strictly larger than $3/4$ or not. Asymptotic results…

We establish some limit theorems for one-dimensional elephant random walk, including Berry-Esseen bounds, Cram\'{e}r moderate deviations and local limit theorems. These limit theorems can be regarded as refinements of the central limit…

We consider a simple symmetric random walk on a spider, that is a collection of half lines (we call them legs) joined at the origin. Our main question is the following: if the walker makes $n$ steps how high can he go up on all legs. This…

Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at…

We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…

We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…

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…

Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph…

A random walk with counterbalanced steps is a process of partial sums $\check S(n)=\check X_1+ \cdots + \check X_n$ whose steps $\check X_n$ are given recursively as follows. For each $n\geq 2$, with a fixed probability $p$, $\check X_n$ is…

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

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…

Associated to a random walk on $\mathbb{Z}$ and a positive integer $n$, there is a return probability of the random walk returning to the origin after $n$ steps. An interesting question is when the set of return probabilities uniquely…