Related papers: Einstein relation for random walk in a one-dimensi…

We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…

Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In particular we show that for a simple random walk starting at…

Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on…

When the memory parameter of the elephant random walk is above a critical threshold, the process becomes superdiffusive and, once suitably normalised, converges to a non-Gaussian random variable. In a recent paper by the three first…

We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…

We consider transient random walks in random environment on Z in the positive speed (ballistic) and critical zero speed regimes. A classical result of Kesten, Kozlov and Spitzer proves that the hitting time of level $n$, after proper…

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 introduce a continuous-time random walk model on an infinite multilayer structure inspired by transportation networks. Each layer is a copy of $\mathbb{R}^d$, indexed by a non-negative integer. A walker moves within a layer by means of…

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

Starting from a simple animal-biology example, a general, somewhat counter-intuitive property of diffusion random walks is presented. It is shown that for any (non-homogeneous) purely diffusing system, under any isotropic uniform incidence,…

We consider a random walk on integers where at the first visits to a site the walker gets a positive drift, but where after a certain number of visits the walker gets a negative drift. We prove that the walker is almost surely transient to…

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

We consider the random walk among random conductances on Z^d. We assume that the conductances are independent, identically distributed and uniformly bounded away from 0 and infinity. We obtain a quantitative version of the central limit…

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

This elementary treatment first summarizes extreme values of a Bernoulli random walk on the one-dimensional integer lattice over a finite discrete time interval. Both the symmetric (unbiased) and asymmetric (biased) cases are discussed.…

Let $G$ be a nonamenable transitive unimodular graph. In dynamical percolation, every edge in $G$ refreshes its status at rate $\mu>0$, and following the refresh, each edge is open independently with probability $p$. The random walk…

We study models of continuous time, symmetric, $\Z^d$-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We…

Let $\xi$ n , n $\in$ N be a sequence of i.i.d. random variables with values in Z. The associated random walk on Z is S(n) = $\xi$ 1 + $\times$ $\times$ $\times$ + $\xi$ n+1 and the corresponding "reflected walk" on N 0 is the Markov chain…

We consider a tracer particle performing a random walk on a two-dimensional lattice in the presence of immobile hard obstacles. Starting from equilibrium, a constant force pulling on the particle is switched on, driving the system to a new…

Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56-84] considered properties of an infinite graph G, and the simple random walk on it, that are preserved by random perturbations. In this paper we solve…