Related papers: Central limit theorems for the monkey walk with st…
Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…
Random walks with memory typically involve rules where a preference for either revisiting or avoiding those sites visited in the past are introduced somehow. Such effects have a direct consequence on the statistics of first-passage and…
In this paper, we introduce a variation of the elephant random walk whose steps are polynomially decaying. At each time $k$, the walker's step size is $k^{-\gamma}$ with $\gamma>0$. We investigate effects of the step size exponent $\gamma$…
We consider random walks in dynamic random environments which arise naturally as spatial embeddings of ancestral lineages in spatial locally regulated population models. In particular, as the main result, we prove the quenched central limit…
Consider the dynamic environment governed by a Poissonian field of independent particles evolving as simple random walks on $\mathbb{Z}^d$. The random walk on random walks model refers to a particular stochastic process on $\mathbb{Z}^d$…
We study a random walk on a point process given by an ordered array of points $(\omega_k, \, k \in \mathbb{Z})$ on the real line. The distances $\omega_{k+1} - \omega_k$ are i.i.d. random variables in the domain of attraction of a…
Random walks process on networks plays a fundamental role in understanding the importance of nodes and the similarity of them, which has been widely applied in PageRank, information retrieval, and community detection, etc. Individual's…
We consider a directed random walk on the backbone of the supercritical oriented percolation cluster in dimensions $d+1$ with $d \ge 3$ being the spatial dimension. For this random walk we prove an annealed local central limit theorem and a…
We consider a multidimensional random walk in a product random environment with bounded steps, transience in some spatial direction, and high enough moments on the regeneration time. We prove an invariance principle, or functional central…
We consider the Grover walk as a 4-state quantum walk without memory in one dimension. The walker in our 4-state quantum walk moves to the left or right. We compute the stationary distribution of the walk, in addition, we obtain the weak…
We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties and concentration inequalities for the environment as seen…
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$…
We consider a directed random walk on the backbone of the infinite cluster generated by supercritical oriented percolation, or equivalently the space-time embedding of the ``ancestral lineage'' of an individual in the stationary…
In this minireview we present the main results regarding the transport properties of stochastic movement with relocations to known positions. To do so, we formulate the problem in a general manner to see several cases extensively studied…
A deterministic walk in a random environment can be understood as a general random process with finite-range dependence that starts repeating a loop once it reaches a site it has visited before. Such process lacks the Markov property. We…
Recently Mc Gettrick [1] introduced and studied a discrete-time 2-state quantum walk (QW) with a memory in one dimension. He gave an expression for the amplitude of the QW by path counting method. Moreover he showed that the return…
In this paper we consider a stochastic process that may experience random reset events which bring suddenly the system to the starting value and analyze the relevant statistical magnitudes. We focus our attention on monotonous…
We consider a nearest-neighbor random walk on $\mathbb{Z}$ whose probability $\omega_x(j)$ to jump to the right from site $x$ depends not only on $x$ but also on the number of prior visits $j$ to $x$. The collection…
We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Chain is of order 2. This corresponds to the walk having a memory of up to two previous steps. We derive the amplitudes and probabilities for…
In this paper, we introduce the elephant random walk (ERW) with memory consisting of randomly selected steps from its history. It is a time-changed variant of the standard elephant random walk with memory consisting of its full history. At…