Related papers: On a random walk with memory and its relation to M…
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…
The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using…
The emergence of heavy-tailed statistics in complex systems is conventionally attributed to non-local stochastic jumps or non-Markovian memory. Here, we present a one-dimensional random walk where power-law behaviors arise instead from a…
For a continuous-time quantum walk on a line the variance of the position observable grows quadratically in time, whereas, for its classical counterpart on the same graph, it exhibits a linear, diffusive, behaviour. A quantum walk, thus,…
The ensemble properties and time-averaged observables of a memory-induced diffusive-superdiffusive transition are studied. The model consists in a random walker whose transitions in a given direction depend on a weighted linear combination…
Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…
In this paper, we propose and analyze a novel one-dimensional inhomogeneous random walk model that combines spatial decay of transition probabilities with a temporal renewal structure for each excursion. In this model, the probability of…
The problem of a random walk in a disordered media is mapped into a model of a random walk with memory. The latter model, as opposed to the former one, does not make reference to a particular realization of the disorder. The equivalence of…
We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…
We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…
Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…
Many complex systems exhibit interactions that depend not only on pairwise connections, but also group structures and memory effects. To capture such effects, we develop a unified tensor framework for modeling higher-order Markov chains…
We consider a walker moving in a one-dimensional interval with absorbing boundaries under the effect of Markovian resettings to the initial position. The walker's motion follows a random walk characterized by a general waiting time…
Recently, in ["The coin-turning walk and its scaling limit", Electronic Journal of Probability, 25 (2020)], the ``coin-turning walk'' was introduced on ${\mathbb Z}$. It is a non-Markovian process where the steps form a (possibly)…
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…
A step-reinforced random walk is a discrete-time non-Markovian process with long range memory. At each step, with a fixed probability p, the positively step-reinforced random walk repeats one of its preceding steps chosen uniformly at…
The model of a tired random walker, whose jump-length decays exponentially in time, is proposed and the motion of such a tired random walker is studied systematically in one, two and three dimensional contin- uum. In all cases, the…
We study a one-dimensional random walk with memory. The behavior of the walker is modified with respect to the simple symmetric random walk (SSRW) only when he is at the maximum distance ever reached from his starting point (home). In this…
Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various timescales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis…
We study the emergence of correlations between $N$ components of the position of a diffusive walker in $N$ dimensions that starts at the origin and resets to previously visited sites with certain probabilities. This is equivalent to $N$…