相关论文: The Elephant random walk with gradually increasing…

We consider one infinite path of a Random Walk in Random Environment (RWRE, for short) in an unknown environment. This environment consists of either i.i.d.\ site or bond randomness. At each position the random walker stops and tells us the…

In this work we investigate a class of random walks that interacts with its environment called Tree Builder Random Walk (TBRW). In our settings, at each step, the walker adds a random number of vertices to its position sampled according to…

In a recent paper [2] the author introduced and investigated a random walk model similar to a model introduced in [1]. In these models the increment of the random walk depends on the complete past of the process. In this note I will point…

We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition of the…

The vertex-reinforced jump process (VRJP), introduced by Davis and Volkov, is a continuous-time process that tends to come-back to already visited vertices. It is closely linked to the edge-reinforced random walk (ERRW) introduced by…

We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…

Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…

Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little is known about random walks that construct the graph where…

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…

Reflected random walk in higher dimension arises from an ordinary random walk (sum of i.i.d. random variables): whenever one of the reflecting coordinates becomes negative, its sign is changed, and the process continues from that modified…

Random walks provide a simple conventional model to describe various transport processes, for example propagation of heat or diffusion of matter through a medium. However, in many practical cases the medium is highly irregular due to…

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…

A quantum random walk on the integers exhibits pseudo memory effects, in that its probability distribution after N steps is determined by reshuffling the first N distributions that arise in a classical random walk with the same initial…

We consider Activated Random Walk (ARW), a particle system with mass conservation, on the cycle $\mathbb{Z}/n\mathbb{Z}$. One starts with a mass density $\mu>0$ of initially active particles, each of which performs a simple symmetric random…

We give a complete and unified description -- under some stability assumptions -- of the functional scaling limits associated with some persistent random walks for which the recurrent or transient type is studied in [1]. As a result, we…

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…

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…

We study a class of nearest-neighbor discrete time integer random walks introduced by Zerner, the so called multi-excited random walks. The jump probabilities for such random walker have a drift to the right whose intensity depends on a…

We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…

We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…