English
Related papers

Related papers: Quenched invariance principle for simple random wa…

200 papers

We consider simple random walks on Delaunay triangulations generated by point processes in $\mathbb{R}^d$. Under suitable assumptions on the point processes, we show that the random walk satisfies an almost sure (or quenched) invariance…

Probability · Mathematics 2014-12-17 Arnaud Rousselle

We establish via a probabilistic approach the quenched invariance principle for a class of long range random walks in independent (but not necessarily identically distributed) balanced random environments, with the transition probability…

Probability · Mathematics 2020-10-27 Xin Chen , Zhen-Qing Chen , Takashi Kumagai , Jian Wang

We consider the simple random walk on the graph corresponding to a Penrose tiling. We prove that the path distribution of the walk converges weakly to that of a non-degenerate Brownian motion for almost every Penrose tiling with respect to…

Probability · Mathematics 2014-07-08 Zs. Bartha , A. Telcs

We consider simple random walks on random graphs embedded in $\mathbb{R}^d$ and generated by point processes such as Delaunay triangulations, Gabriel graphs and the creek-crossing graphs. Under suitable assumptions on the point process, we…

Probability · Mathematics 2015-06-19 Arnaud Rousselle

We derive a quenched invariance principle for random walks in random environments whose transition probabilities are defined in terms of weighted cycles of bounded length. To this end, we adapt the proof for random walks among random…

Probability · Mathematics 2008-12-18 Jean-Dominique Deuschel , Holger Kösters

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 consider a random walk on Z^d in an i.i.d. balanced random environment, that is a random walk for which the probability to jump from x to nearest neighbor x+e is the same as to nearest neighbor x-e. Assuming that the environment is…

Probability · Mathematics 2012-07-05 Noam Berger , Jean-Dominique Deuschel

We consider the random conductance model in a stationary and ergodic environment. Under suitable moment conditions on the conductances and their inverse, we prove a quenched invariance principle for the random walk among the random…

Probability · Mathematics 2019-02-18 Peter Bella , Mathias Schäffner

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…

Probability · Mathematics 2016-05-18 Zhang Zhongyang , Zhang Li-Xin

Consider the invariance principle for a random walk with random environment (denoted by $\mu$) in time on $\bfR$ in a weak quenched sense. We show that a sequence of the random probability measures on $\bfR$ generated by a bounded Lipschitz…

Probability · Mathematics 2023-03-14 You Lv , Wenming Hong

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…

Probability · Mathematics 2012-10-08 Christophe Gallesco , Serguei Popov

Via a Dirichlet form extension theorem and making full use of two-sided heat kernel estimates, we establish quenched invariance principles for random walks in random environments with a boundary. In particular, we prove that the random walk…

Probability · Mathematics 2015-09-10 Zhen-Qing Chen , David A. Croydon , Takashi Kumagai

We consider the simple random walk on the (unique) infinite cluster of super-critical bond percolation in $\Z^d$ with $d\ge2$. We prove that, for almost every percolation configuration, the path distribution of the walk converges weakly to…

Probability · Mathematics 2007-05-23 Noam Berger , Marek Biskup

We consider a stationary and ergodic random field $\{\omega(e) : e \in E_d\}$ that is parameterized by the edge set of the Euclidean lattice $\mathbb{Z}^d$, $d \geq 2$. The random variable $\omega(e)$, taking values in $[0, \infty)$ and…

Probability · Mathematics 2018-01-23 Jean-Dominique Deuschel , Tuan Anh Nguyen , Martin Slowik

We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…

Probability · Mathematics 2007-05-23 Peter Eichelsbacher , Wolfgang Konig

We prove quenched invariance principle for simple random walk on the unique infinite percolation cluster for a general class of percolation models on Z^d, d>=2, with long-range correlations introduced in arXiv:1212.2885, solving one of the…

Probability · Mathematics 2015-09-28 Eviatar Procaccia , Ron Rosenthal , Artem Sapozhnikov

We prove an almost sure invariance principle for a random walker among i.i.d. conductances in $\Z^d$, $d\geq 2$. We assume conductances are bounded from above but we dot require they are bounded from below.

Probability · Mathematics 2012-09-11 P. Mathieu

We study a class of non-reversible, continuous-time random walks in random environments on $\mathbb{Z}^d$ that admit a cycle representation with finite cycle length. The law of the transition rates, taking values in $[0, \infty)$, is…

Probability · Mathematics 2024-11-12 Jean-Dominique Deuschel , Martin Slowik , Weile Weng

We are concerned with random walks on $\mathbb{Z}^d$, $d\geq 3$, in an i.i.d. random environment with transition probabilities $\epsilon$-close to those of simple random walk. We assume that the environment is balanced in one fixed…

Probability · Mathematics 2016-12-28 Erich Baur

In this paper, we establish a quenched invariance principle for the random walk on a certain class of infinite, aperiodic, oriented random planar graphs called "T-graphs" [Kenyon-Sheffield04]. These graphs appear, together with the…

Probability · Mathematics 2014-01-15 Benoit Laslier
‹ Prev 1 2 3 10 Next ›