English
Related papers

Related papers: Biased random walk on dynamical percolation

200 papers

In this paper we consider a class of one-dimensional interacting particle systems in equilibrium, constituting a dynamic random environment, together with a nearest-neighbor random walk that on occupied/vacant sites has a local drift to the…

Probability · Mathematics 2009-11-13 L. Avena , F. den Hollander , F. Redig

We prove a {\it{quenched}} large deviation principle (LDP) for a simple random walk on a supercritical percolation cluster on $\Z^d$, $d\geq 2$.. We take the point of view of the moving particle and first prove a quenched LDP for the…

Probability · Mathematics 2015-04-02 Noam Berger , Chiranjib Mukherjee

In previous work by Avena and den Hollander, a model of a one-dimensional random walk in a dynamic random environment was proposed where the random environment is resampled from a given law along a growing sequence of deterministic times.…

Probability · Mathematics 2018-03-12 L. Avena , Y. Chino , C. da Costa , F. den Hollander

We prove the almost sure ('quenched') invariance principle for a random walker on an infinite Bernoulli percolation cluster in $\Z^d$ where $d$ is larger or equal than 2.

Probability · Mathematics 2012-09-11 P. Mathieu , A. L. Piatnitski

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…

Probability · Mathematics 2016-08-14 Firas Rassoul-Agha , Timo Seppäläinen

We study one-dimensional nearest neighbour random walk in site-random environment. We establish precise (sharp) large deviations in the so-called ballistic regime, when the random walk drifts to the right with linear speed. In the…

Probability · Mathematics 2018-01-08 Dariusz Buraczewski , Piotr Dyszewski

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…

Probability · Mathematics 2024-07-23 Chenlin Gu , Jianping Jiang , Yuval Peres , Zhan Shi , Hao Wu , Fan Yang

We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability p by studying three classes of…

Probability · Mathematics 2007-05-23 Dayue Chen , Fuxi Zhang

We study limit laws for simple random walks on supercritical long range percolation clusters on $\Z^d, d \geq 1$. For the long range percolation model, the probability that two vertices $x, y$ are connected behaves asymptotically as…

Probability · Mathematics 2010-01-28 Nicholas Crawford , Allan Sly

We study the asymptotic behaviour of random walks in i.i.d. random environments on $\Z^d$. The environments need not be elliptic, so some steps may not be available to the random walker. We prove a monotonicity result for the velocity (when…

Probability · Mathematics 2018-11-27 Mark Holmes , Thomas S. Salisbury

We study the asymptotic behavior the exit times of random walk from Euclidean balls around the origin of the incipient infinite cluster in a manner inspired by [26]. We do this by obtaining bounds on the effective resistance between the…

Probability · Mathematics 2013-12-06 Markus Heydenreich , Remco van der Hofstad , Tim Hulshof

We prove an invariance principle for continuous-time random walks in a dynamically averaging environment on $\mathbb Z$. In the beginning, the conductances may fluctuate substantially, but we assume that as time proceeds, the fluctuations…

Probability · Mathematics 2020-09-24 Stein Andreas Bethuelsen , Christian Hirsch , Christian Mönch

The goal of this note is to prove a law of large numbers for the empirical speed of a green particle that performs a random walk on top of a field of red particles which themselves perform independent simple random walks on $\Z^d$, $d \geq…

Probability · Mathematics 2013-05-07 Frank den Hollander , Harry Kesten , Vladas Sidoravicius

We consider two models of one-dimensional random walks among biased i.i.d. random conductances: the first is the classical exponential tilt of the conductances, while the second comes from the effect of adding an external field to a random…

Probability · Mathematics 2017-11-15 Quentin Berger , Michele Salvi

We consider a random walk in an i.i.d. random environment on Z that is perturbed by cookies of strength 1. The number of cookies per site is assumed to be i.i.d. Results on the speed of the random walk are obtained. Our main tool is the…

Probability · Mathematics 2015-01-19 Elisabeth Bauernschubert

For the supercritical Bernoulli bond percolation on $\mathbb{Z}^d$ ($d \geq 2$), we give a coupling between the random walk on the infinite cluster and its limit Brownian motion, such that the maximum distance between the paths during…

Probability · Mathematics 2025-08-05 Chenlin Gu , Zhonggen Su , Ruizhe Xu

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…

Probability · Mathematics 2017-08-07 L. Avena , F. den Hollander

In this paper, we consider a stochastic process that may experience random reset events which relocate the system to its starting position. We focus our attention on a one-dimensional, monotonic continuous-time random walk with a constant…

Mathematical Physics · Physics 2017-10-11 Miquel Montero , Axel Masó-Puigdellosas , Javier Villarroel

Random walks of n steps taken into independent uniformly random directions in a d-dimensional Euclidean space (d larger than 1), are named Dirichlet when their step lengths are distributed according to a Dirichlet law. The latter continuous…

Statistical Mechanics · Physics 2015-03-24 Gerard Le Caer

Our main goal is to study a class of processes whose increments are generated via a cellular automata rule. Given the increments of a simple biased random walk, a new sequence of (dependent) Bernoulli random variables is produced. It is…

Probability · Mathematics 2017-10-24 Andrea Collevecchio , Kais Hamza , Yunxuan Liu