English
Related papers

Related papers: Random Walks in Random Environments with Rare Anom…

200 papers

We study the asymptotic behaviour of random walks in i.i.d. non-elliptic random environments on $\mathbb{Z}^d$. Standard conditions (and proofs) for ballisticity and the central limit theorem require ellipticity. We use oriented percolation…

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

We show that random walk in uniformly elliptic i.i.d. environment in dimension $\geq5$ has at most one non zero limiting velocity. In particular this proves a law of large numbers in the distributionally symmetric case and establishes…

Probability · Mathematics 2009-09-29 Noam Berger

We study the favourite sites of a random walk evolving in a sparse random environment on the set of integers. The walker moves symmetrically apart from some randomly chosen sites where we impose random drift. We prove annealed limit…

Probability · Mathematics 2025-08-04 Alicja Kołodziejska

We investigate random walks in independent, identically distributed random sceneries under the assumption that the scenery variables satisfy Cramer's condition. We prove moderate deviation principles in dimensions two and larger, covering…

Probability · Mathematics 2007-05-23 Klaus Fleischmann , Peter Morters , Vitali Wachtel

We study a random walk on $\mathbb{Z}$ which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, $p$ and $q$. $R$ consecutive right jumps from a site in the $q$-mode are required…

Probability · Mathematics 2015-03-05 Ross G. Pinsky , Nicholas F. Travers

We consider a discrete time random walk in a space-time i.i.d. random environment. We use a martingale approach to show that the walk is diffusive in almost every fixed environment. We improve on existing results by proving an invariance…

Probability · Mathematics 2007-05-23 F. Rassoul-Agha , T. Seppalainen

The iterated random walk is a random process in which a random walker moves on a one-dimensional random walk which is itself taking place on a one-dimensional random walk, and so on. This process is investigated in the continuum limit using…

Statistical Mechanics · Physics 2007-05-23 L. Turban

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

Statistical Mechanics · Physics 2019-02-20 Stephane Blanco , Fournier Richard

We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition of the…

Probability · Mathematics 2008-12-10 Anne-Laure Basdevant , Arvind Singh

We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…

Statistical Mechanics · Physics 2009-11-11 G. Oshanin , R. Voituriez , S. Nechaev , O. Vasilyev , F. Hivert

We explore some of the connections between the local picture left by the trace of simple random walk on a discrete cylinder with base a d-dimensional torus, d at least 2, of side-length N running for times of order N^{2d} and the model of…

Probability · Mathematics 2009-07-06 Alain-Sol Sznitman

We consider a random walk in a fixed Z environment composed of two point types: (q,1-q) and (p,1-p) for 1/2<q<p. We study the expected hitting time at N for a given number k of p-drifts in the interval [1,N-1], and find that this time is…

Probability · Mathematics 2017-06-19 Amichai Lampert , Assaf Shapira

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

Probability · Mathematics 2018-07-19 Roberto I. Oliveira , Yuval Peres

We consider large deviations for nearest-neighbor random walk in a uniformly elliptic i.i.d. environment. It is easy to see that the quenched and the averaged rate functions are not identically equal. When the dimension is at least four and…

Probability · Mathematics 2010-04-09 Atilla Yilmaz

We perform simulations for one dimensional continuous-time random walks in two dynamic random environments with fast (independent spin-flips) and slow (simple symmetric exclusion) decay of space-time correlations, respectively. We focus on…

Probability · Mathematics 2012-05-23 L. Avena , P. Thomann

In this work, we study the large deviation properties of random walk in a random environment on $\mathbb{Z}^d$ with $d\geq1$. We start with the quenched case, take the point of view of the particle, and prove the large deviation principle…

Probability · Mathematics 2008-09-09 Atilla Yilmaz

In this work we study a natural transition mechanism describing the passage from a quenched (almost sure) regime to an annealed (in average) one, for a symmetric simple random walk on random obstacles on sites having an identical and…

Probability · Mathematics 2016-08-16 Gérard Ben Arous , Stanislav Molchanov , Alejandro F. Ramírez

We consider the random walk in an \emph{i.i.d.} random environment on the infinite $d$-regular tree for $d \geq 3$. We consider the tree as a Cayley graph of free product of finitely many copies of $\Zbold$ and $\Zbold_2$ and define the…

Probability · Mathematics 2014-04-30 Siva Athreya , Antar Bandyopadhyay , Amites Dasgupta

In 2003, Varadhan [V03] developed a robust method for proving quenched and averaged large deviations for random walks in a uniformly elliptic and i.i.d. environment (RWRE) on $\mathbb Z^d$. One fundamental question which remained open was…

Probability · Mathematics 2021-08-26 Rodrigo Bazaes , Chiranjib Mukherjee , Alejandro Ramirez , Santiago Saglietti

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…

Probability · Mathematics 2020-06-19 Leran Cai , Thomas Sauerwald , Luca Zanetti