Related papers: Elephants can always remember: Exact long-range me…
In a step reinforced random walk, at each integer time and with a fixed probability p $\in$ (0, 1), the walker repeats one of his previous steps chosen uniformly at random, and with complementary probability 1 -- p, the walker makes an…
The first-return time is the time that it takes a random walker to go back to the initial position for the first time. We study the first-return time when random walkers perform fractional kinetics, specifically fractional diffusion, that…
Starting from the model of continuous time random walk, we focus our interest on random walks in which the probability distributions of the waiting times and jumps have fat tails characterized by power laws with exponent between 0 and 1 for…
The orientational memory of particles can serve as an effective measure of diffusivity, spreading, and search efficiency in complex stochastic processes. We develop a theoretical framework to describe the decay of directional correlations…
We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…
A space fractional diffusion-like equation is introduced, which embodies the nonlocality in time, represented by the memory kernel and the non-locality in space. A specific example of the nonlocal term is considered in combination with…
We investigate the ballistic spreading behavior of the one-dimensional discrete time quantum walks whose time evolution is driven by any balanced quantum coin. We obtain closed-form expressions for the long-time variance of position of…
Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…
We study a discrete-time random walk on the non-negative integers, such that when 0 is reached a jump occurs to an arbitrary location, with given probabilities. We obtain an asymptotic formula for the expected position at large times, in…
A novel version of the Continuous-Time Random Walk (CTRW) model with memory is developed. This memory means the dependence between arbitrary number of successive jumps of the process, while waiting times between jumps are considered as…
The monkey walk is a stochastic process defined as the trajectory of a walker that moves on $\mathbb R^d$ according to a Markovian generator, except at some random "relocation" times at which it jumps back to its position at a time sampled…
We consider a continuous random walk model for describing normal as well as anomalous diffusion of particles subjected to an external force when these particles diffuse in a uniformly expanding (or contracting) medium. A general equation…
We introduce a one-dimensional random walk, which at each step performs a reinforced dynamics with probability $\theta$ and with probability $1 - \theta$, the random walk performs a step independent of the past. We analyse its asymptotic…
In this paper, we explain the connection between the Elephant Random Walk (ERW) and an urn model \`a la P\'olya and derive functional limit theorems for the former. The ERW model was introduced by Sch\"utz and Trimper [2004] to study memory…
We develop importance sampling based efficient simulation techniques for three commonly encountered rare event probabilities associated with random walks having i.i.d. regularly varying increments; namely, 1) the large deviation…
In this paper we consider the one-dimensional, biased, randomly trapped random walk when the trapping times have infinite variance. We prove sufficient conditions for the suitably scaled walk to converge to a transformation of a stable…
A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the…
We study a random walk model in which the jumping probability to a site is dependent on the number of previous visits to the site, as a model of the mobility with memory. To this end we introduce two parameters called the memory parameter…
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…
The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…