Related papers: On a random walk with memory and its relation to M…
L\'evy walks are continuous time random walks with spatio-temporal coupling of jump lengths and waiting times, often used to model superdiffusive spreading processes such as animals searching for food, tracer motion in weakly chaotic…
We study how the Hurst exponent $\alpha$ depends on the fraction $f$ of the total time $t$ remembered by non-Markovian random walkers that recall only the distant past. We find that otherwise nonpersistent random walkers switch to…
We study analytically a simple random walk model on a one-dimensional lattice, where at each time step the walker resets to the maximum of the already visited positions (to the rightmost visited site) with a probability $r$, and with…
We suggest a model for data losses in a single node of a packet-switched network (like the Internet) which reduces to one-dimensional discrete random walks with unusual boundary conditions. The model shows critical behavior with an abrupt…
We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…
This work analyzes fractional continuous-time random walks on two-layer multiplexes. A node-centric dynamics is used, in which it is assumed a Poisson distribution of a walker to become active, while a jump to one of its neighbors depends…
The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…
We calculate the diffusion coefficients of persistent random walks on lattices, where the direction of a walker at a given step depends on the memory of a certain number of previous steps. In particular, we describe a simple method which…
The investigation of random walks is central to a variety of stochastic processes in physics, chemistry, and biology. To describe a transport phenomenon, we study a variant of the one-dimensional persistent random walk, which we call a…
We perform simulations for one dimensional continuous-time random walks in two dynamic random environments with fast (independent spin-flips) and slow (simple symmetric exclusion) decay of space-time correlations, respectively. We focus on…
Memory effects are ubiquitous in small-scale systems. They emerge from interactions between accessible and inaccessible degrees of freedom and give rise to evolution equations that are non-local in time. If the characteristic time scales of…
We consider random walks in dynamic random environments and propose a criterion which, if satisfied, allows to decompose the random walk trajectory into i.i.d. increments, and ultimately to prove limit theorems. The criterion involves the…
In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…
We study the relaxation time in the random walk with jumps. The random walk with jumps combines random walk based sampling with uniform node sampling and improves the performance of network analysis and learning tasks. We derive various…
Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…
Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…
We consider two models of one-dimensional random walks among biased i.i.d. random conductances: the first is the classical exponential tilt of the conductances, while the second comes from the effect of adding an external field to a random…
In human crowds, interactions among individuals give rise to a variety of self-organized collective motions that help the group to effectively solve the problem of coordination. However, it is still not known exactly how humans adjust their…
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 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…