Related papers: Diffusivity of a random walk on random walks

We consider a symmetric random walk on the $\nu$-dimensional lattice, whose exit probability from the origin is modified by an antisymmetric perturbation and prove the local central limit theorem for this process. A short-range correction…

We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is $\mathrm{SO}(2,1)$ or $\mathrm{SO}(3,1)$ and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense…

Although the theoretical behavior of one-dimensional random walks in random environments is well understood, the numerical evaluation of various characteristics of such processes has received relatively little attention. This paper develops…

We consider the distribution of the duration time, the time elapsed since it began, of a diffusion process given its present position, under the assumption that the process began at the origin. For unbiased diffusion, the distribution does…

Quantum walks and random walks bear similarities and divergences. One of the most remarkable disparities affects the probability of finding the particle at a given location: typically, almost a flat function in the first case and a…

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

We determine the rate of escape from a potential well, and the diffusion coefficient in a periodic potential, of a random walker that moves under the influence of the potential in between successive collisions with the heat bath. In the…

In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…

We introduce a Gibbs measure on nearest-neighbour paths of length $t$ in the Euclidean $d$-dimensional lattice, where each path is penalised by a factor proportional to the size of its boundary and an inverse temperature $\beta$. We prove…

We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional coins to dilute the effects of interference.…

We consider Sinai's random walk in random environment. We prove that for an interval of time [1,n] Sinai's walk sojourns in a small neighborhood of the point of localization for the quasi totality of this amount of time. Moreover the local…

We consider a random walk $\tilde S$ which has different increment distributions in positive and negative half-planes. In the upper half-plane the increments are mean-zero i.i.d. with finite variance. In the lower half-plane we consider two…

In a recent paper we proposed a non-Markovian random walk model with memory of the maximum distance ever reached from the starting point (home). The behavior of the walker is at variance with respect to the simple symmetric random walk…

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…

Using the discrepancy metric, we analyze the rate of convergence of a random walk on the circle generated by d rotations, and establish sharp rates that show that badly approximable d-tuples in R^d give rise to walks with the fastest…

With the purpose of explaining recent experimental findings, we study the distribution $A(\lambda)$ of distances $\lambda$ traversed by a block that slides on an inclined plane and stops due to friction. A simple model in which the friction…

Let $S=(S_k)_{k\geq 0}$ be a random walk on $\mathbb{Z}$ and $\xi=(\xi_{i})_{i\in\mathbb{Z}}$ a stationary random sequence of centered random variables, independent of $S$. We consider a random walk in random scenery that is the sequence of…

Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…

A class of generalized exclusion processes parametrized by the maximal occupancy, $k\geq 1$, is investigated. For these processes with symmetric nearest-neighbor hopping, we compute the diffusion coefficient and show that it is independent…

We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…