Related papers: Directed random walk on the backbone of an oriente…

We identify the asymptotic distribution of the chemical distance in high-dimensional critical Bernoulli percolation. Namely, we show that the distance between the origin and a distant vertex conditioned to lie in the cluster of the origin…

We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.

In this article, we consider a Branching Random Walk on the real line. The genealogical structure is assumed to be given through a supercritical branching process in the i.i.d. environment and satisfies the Kesten-Stigum condition. The…

We study the distribution of dynamical quantities in various one-dimensional, disordered models the critical behavior of which is described by an infinite randomness fixed point. In the {\it disordered contact process}, the quenched…

One class of random walks with infinite memory, so called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We…

We consider a random walk on a random graph $(V,E)$, where $V$ is the set of open sites under i.i.d. Bernoulli site percolation on the multi-dimensional integer set $\mathbf{Z}^d$, and the transition probabilities of the walk are generated…

A law of the iterated logarithm is established for the last passage times of directed percolation on rectangles in the plane over exponential or geometric independent random variables, rescaled to converge to the Tracy-Widom distribution.…

We study biased random walk on the infinite connected component of supercritical percolation on the integer lattice $\mathbb{Z}^d$ for $d\geq 2$. For this model, Fribergh and Hammond showed the existence of an exponent $\gamma$ such that:…

Let $\log^Cn\le d\le n/2$ for a sufficiently large constant $C>0$ and let $A_n$ denote the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices. We prove that as $n$ tends to infinity, the empirical spectral…

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$…

The Central Limit Theorem for the random walk on a stationary random network of conductances has been studied by several authors. In one dimension, when conductances and resistances are integrable, and following a method of martingale…

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…

We consider the branching random walks in $d$-dimensional integer lattice with time--space i.i.d. offspring distributions. Then the normalization of the total population is a nonnegative martingale and it almost surely converges to a…

We consider a random walk in an i.i.d. Cauchy-tailed conductances environment. We obtain a quenched functional CLT for the suitably rescaled random walk, and, as a key step in the arguments, we improve the local limit theorem for…

We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…

In this paper we consider a time-continuous random walk in $\mathbb{Z}^d$ in a dynamical random environment with symmetric jump rates to nearest neighbours. We assume that these random conductances are stationary and ergodic and, moreover,…

Consider a random walk among random conductances on $\mathbb{Z}^d$ with $d\geq 2$. We study the quenched limit law under the usual diffusive scaling of the random walk conditioned to have its first coordinate positive. We show that the…

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…

We consider a ballistic random walk in an i.i.d. random environment that does not allow retreating in a certain fixed direction. We prove an invariance principle (functional central limit theorem) under almost every fixed environment. The…

We prove existence of the large deviation principle, with a proper convex rate function, for the distribution of the renormalized distance from the origin of a random walk on a free product of finitely generated groups. As a consequence, we…