Related papers: Limiting behavior of the distance of a random walk
We present a real space renormalization group scheme for the problem of random walks in a random environment on a strip, which includes one-dimensional random walk in random environment with bounded non-nearest-neighbor jumps. We show that…
We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…
We propose a model of a one-dimensional random walk in dynamic random environment that interpolates between two classical settings: (I) the random environment is sampled at time zero only; (II) the random environment is resampled at every…
We consider a random walk in dimension $d\geq 1$ in a dynamic random environment evolving as an interchange process with rate $\gamma>0$. We only assume that the annealed drift is non-zero. We prove that the empirical velocity of the walker…
In this paper, we study the scaling limit of a class of random walks which behave like simple random walks outside of a bounded region around the origin and which are subject to a partial reflection near the origin. If the probability of…
We study nearest-neighbors branching random walks started from a point at the interior of a hypercube. We show that the probability that the process escapes the hypercube is monotonically decreasing with respect to the distance of its…
We consider a random walk model in a one-dimensional environment, formed by several zones of finite width with the fixed transition probabilities. It is also assumed that the transitions to the left and right neighboring points have unequal…
We present experimental results obtained for a one-dimensional flow using high precision motion capture. The full pedestrians' trajectories are obtained. In this paper, we focus on the fundamental diagram, and on the relation between the…
The diffusion of a particle in a crowded environment typically proceeds through three regimes: for very short times the particle diffuses freely until it collides with an obstacle for the first time, while for very long times diffusion the…
Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the…
Quantum walks behave differently from what we expect and their probability distributions have unique structures. They have localization, singularities, a gap, and so on. Those features have been discovered from the view point of mathematics…
We study the mixing time of random walks on small-world networks modelled as follows: starting with the 2-dimensional periodic grid, each pair of vertices $\{u,v\}$ with distance $d>1$ is added as a "long-range" edge with probability…
It is a celebrated fact that a simple random walk on an infinite $k$-ary tree for $k \geq 2$ returns to the initial vertex at most finitely many times during infinitely many transitions; it is called transient. This work points out the fact…
We analyse how simple local constraints in two dimensions lead a defect to exhibit robust, non-transient, and tunable, subdiffusion. We uncover a rich dynamical phenomenology realised in ice- and dimer-type models. On the microscopic scale…
* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…
We consider one dimensional random walks in random environment where every time the process stays at a location, it dies with a fixed probability. Under some mild assumptions it is easy to show that the survival probability goes to zero as…
We study, on a $d$ dimensional hypercubic lattice, a random walk which is homogeneous except for one site. Instead of visiting this site, the walker hops over it with arbitrary rates. The probability distribution of this walk and the…
We prove that the simple random walk on the uniform infinite planar triangulation (UIPT) typically travels graph distance at most $n^{1/4 + o_n(1)}$ in $n$ units of time. Together with the complementary lower bound proven by Gwynne and…
We consider a system of independent random walks in a common random environment. Previously, a hydrodynamic limit for the system of RWRE was proved under the assumption that the random walks were transient with positive speed. In this paper…
We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…