Related papers: Estimates on Escape Times for the Elephant Random …
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…
We give a short proof of the recurrence of the two-dimensional elephant random walk in the diffusive regime. This was recently established by Shuo Qin, but our proof only uses very rough comparison with the standard plane random walk. We…
A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…
Let $M_n$ be the number of steps of the loop-erasure of a simple random walk on $\mathbb{Z}^2$ from the origin to the circle of radius $n$. We relate the moments of $M_n$ to $Es(n)$, the probability that a random walk and an independent…
We establish stable functional central limit theorems for scaled elephant random walks in the diffusive, critical, and superdiffusive cases using the martingale approach.
Consider a random walk whose (light-tailed) increments have positive mean. Lower and upper bounds are provided for the expected maximal value of the random walk until it experiences a given drawdown d. These bounds, related to the Calmar…
We extend to the gamut of functional forms of the probability distribution of the time-dependent step-length a previous model dubbed Elephant Quantum Walk, which considers a uniform distribution and yields hyperballistic dynamics where the…
We discuss the quenched tail estimates for the random walk in random scenery. The random walk is the symmetric nearest neighbor walk and the random scenery is assumed to be independent and identically distributed, non-negative, and has 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…
By appealing to renewal theory we determine the equations that the mean exit time of a continuous-time random walk with drift satisfies both when the present coincides with a jump instant or when it does not. Particular attention is paid to…
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.…
We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…
We consider multidimensional random walks in pyramids, which by definition are cones formed by finite intersections of half-spaces. The main object of interest is the survival probability $\mathbb{P}(\tau>n)$, $\tau$ denoting the first exit…
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…
We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate…
Exploration and trapping properties of random walkers that may evanesce at any time as they walk have seen very little treatment in the literature, and yet a finite lifetime is a frequent occurrence, and its effects on a number of random…
Continuous time random Walk model has been versatile analytical formalism for studying and modeling diffusion processes in heterogeneous structures, such as disordered or porous media. We are studying the continuous limits of Heterogeneous…
In order to approximate the exit time of a one-dimensional diffusion process, we propose an algorithm based on a random walk. Such an algorithm was already introduced in both the Brownian context and in the Ornstein-Uhlenbeck context. Here…
Motivated by the dissipative abelian sandpile model, we analyze the trajectories of a one-dimensional random walk in a landscape of soft traps. These traps, placed at increasing distances from each other, correspond to dissipative sites in…
We introduce and investigate the escape problem for random walkers that may eventually die, decay, bleach, or lose activity during their diffusion towards an escape or reactive region on the boundary of a confining domain. In the case of a…