Quenched invariance principles for random walks on percolation clusters
P. Mathieu, A. L. Piatnitski
备注:
Different and more self-contained exposition of the main step of the proof. Paper can now be read without any previous knowledge on 2 scale convergence
发表信息:
Proceedings A of the Royal Society, vol. 463, 2287-2307, 2007
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.
We consider random walk on dynamical percolation on the discrete torus $\mathbb{Z}_n^d$. In previous work, mixing times of this process for $p<p_c(\mathbb{Z}^d)$ were obtained in the annealed setting where one averages over the dynamical percolation environment. Here we study exit times in the quenched setting, where we condition on a typical dynamical percolation environment. We obtain an upper bound for all $p$ which for $p<p_c$ matches the known lower bound.
We explore the survival function for percolation on Galton-Watson trees. Letting $g(T,p)$ represent the probability a tree $T$ survives Bernoulli percolation with parameter $p$, we establish several results about the behavior of the random function $g(\mathbf{T} , \cdot)$, where $\mathbf{T}$ is drawn from the Galton-Watson distribution. These include almost sure smoothness in the supercritical region; an expression for the $k\text{th}$-order Taylor expansion of $g(\mathbf{T} , \cdot)$ at criticality in terms of limits of martingales defined from $\mathbf{T}$ (this requires a moment condition d…
The fourfold research proposal regards in particular: critical oriented percolation; random walk limit laws; neural networks with long-range connections; the ant in a labyrinth.
We prove a {\it{quenched}} large deviation principle (LDP) for a simple random walk on a supercritical percolation cluster (SRWPC) on $\mathbb Z^d$ ($d\geq 2$). The models under interest include classical Bernoulli bond and site percolation as well as models that exhibit long range correlations, like the random cluster model, the random interlacement and {the vacant set of random interlacements} (for $d\geq 3$) and the level sets of the Gaussian free field ($d\geq 3$). Inspired by the methods developed by Kosygina, Rezakhanlou and Varadhan ([KRV06]) for proving quenched LDP for elliptic diffus…
Spatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuum space version of scale-free percolation introduced in [DW18]. This is an undirected inhomogeneous random graph whose vertices are given by a Poisson point process in $\mathbb R^d$. Each vertex is equipped with a random weight and the probability that two vertices are connected by an edge depends on their weights and on their distance. Under suitable conditions on the parameters of the model, we show that, for almost all realizations of the point process, the degree dis…
We prove that the probability of crossing a large square in quenched Voronoi percolation converges to 1/2 at criticality, confirming a conjecture of Benjamini, Kalai and Schramm from 1999. The main new tools are a quenched version of the box-crossing property for Voronoi percolation at criticality, and an Efron-Stein type bound on the variance of the probability of the crossing event in terms of the sum of the squares of the influences. As a corollary of the proof, we moreover obtain that the quenched crossing event at criticality is almost surely noise sensitive.
We show that random walks on the infinite supercritical percolation clusters in Z^d satisfy the usual Law of the Iterated Logarithm. The proof combines Barlow's Gaussian heat kernel estimates and the ergodicity of the random walk on the environment viewed from the random walker as derived by Berger and Biskup.
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 trees. A sufficient condition is established for Galton-Watson trees.
We study the speed of a biased random walk on a percolation cluster on $\Z^d$ in function of the percolation parameter $p$. We obtain a first order expansion of the speed at $p=1$ which proves that percolating slows down the random walk at least in the case where the drift is along a component of the lattice.
We show quenched large deviations for the simple random walk on a certain class of percolations with long-range correlations. This class contains the supercritical Bernoulli percolations, the model considered by Drewitz, R'ath and Sapozhnikov and the random-cluster model up to the slab critical point. Our result is an extension of Kubota's result for the supercritical Bernoulli percolations. We also state a shape theorem for the chemical distance, which is an extension of Garet and Marchand's result for the supercritical Bernoulli percolations.
For biased random walk on the infinite cluster in supercritical i.i.d.\ percolation on $\Z^2$, where the bias of the walk is quantified by a parameter $β>1$, it has been conjectured (and partly proved) that there exists a critical value $β_c>1$ such that the walk has positive speed when $β<β_c$ and speed zero when $β>β_c$. In this paper, biased random walk on the infinite cluster of a certain translation invariant percolation process on $\Z^2$ is considered. The example is shown to exhibit the opposite behavior to what is expected for i.i.d.\ percolation, in the sense that it has a critical va…
We consider the simple random walk on supercritical percolation clusters in the multidimensional cubic lattice. In this model, a quenched large deviation principle holds for the position of the random walk. Its rate function depends on the law of the percolation configuration, and the aim of this paper is to study the continuity of the rate function in the law. To do this, it is useful that the rate function is expressed by the so-called Lyapunov exponent, which is the asymptotic cost paid by the random walk for traveling in a landscape of percolation configurations. In this context, we first …
We study the quenched behaviour of a perturbed version of the simple symmetric random walk on the set of integers. The random walker moves symmetrically with an exception of some randomly chosen sites where we impose a random drift. We show that if the gaps between the marked sites are i.i.d. and regularly varying with a sufficiently small index, then there is no strong quenched limit laws for the position of the random walker. As a consequence we study the quenched limit laws in the context of weak convergence of random measures.
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 open problems from there. This gives new results for random interlacements in dimension d>=3 at every level, as well as for the vacant set of random interlacements and the level sets of the Gaussian free field in the regime of the so-called local uniqueness (which is believed to coincide with the whole supercritical regime). An essential ingredient of our pr…
We consider a weighted random walk on the backbone of an oriented percolation cluster. We determine necessary conditions on the weights for Brownian scaling limits under the annealed and the quenched law. This model is a random walk in dynamic random environment (RWDRE), where the environment is mixing, non-Markovian and not elliptic. We provide a generalization of results obtained previously by Birkner et al. (2013).
We consider the small deviation probability for random walk with time-inhomogeneous random environment. Compared with the result in Mogul'ski\uı (1974) for the i.i.d. random walk, the rate is smaller (due to the random environment), which is specified in terms of the quenched and annealed variance.
It is shown that oriented random walk on the Heisenberg group admits exponential intersection tail. As a corollary we get that on any transitive graph of polynomial volume growth, which is not a finite extension of $\mathbb{Z}, \mathbb{Z}^2$, the infinite cluster of percolation with retention parameter $p$, close enough to $1$, is transient.
Unlike classical simple random walks, one-dimensional random walks in random environments (RWRE) are known to have a wide array of potential limiting distributions. Under certain assumptions, however, it is known that CLT-like limiting distributions hold for the walk under both the quenched and averaged measures. We give upper bounds on the rates of convergence for the quenched central limit theorems for both the hitting time and position of the RWRE with polynomial rates of convergence that depend on the distribution on environments.
For a one-dimensional random walk in random scenery (RWRS) on Z, we determine its quenched weak limits by applying Strassen's functional law of the iterated logarithm. As a consequence, conditioned on the random scenery, the one-dimensional RWRS does not converge in law, in contrast with the multi-dimensional case.
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 conditional limit law is the product of a Brownian meander and a $(d-1)$-dimensional Brownian motion.
We prove a quenched central limit theorem for balanced random walks in time dependent ergodic random environments which is not necessarily nearest-neigbhor. We assume that the environment satisfies appropriate ergodicity and ellipticity conditions. The proof is based on the use of a maximum principle for parabolic difference operators.
Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$. This function is supposed to be increasing, so that the random walk is attracted by bigger clusters. For $f(t)=e^{βt}$ we prove that there is a phase transition in $β$, i.e., the random walk is subdiffusive for large $β$ and is diffusive for small $β$.
We study quenched distributions on random walks in a random potential on integer lattices of arbitrary dimension and with an arbitrary finite set of admissible steps. The potential can be unbounded and can depend on a few steps of the walk. Directed, undirected and stretched polymers, as well as random walk in random environment, are covered. The restriction needed is on the moment of the potential, in relation to the degree of mixing of the ergodic environment. We derive two variational formulas for the limiting quenched free energy and prove a process-level quenched large deviation principle…
We study a continuous time random walk on the $d$-dimensional lattice, subject to a drift and an attraction to large clusters of a subcritical Bernoulli site percolation. We find two distinct regimes: a ballistic one, and a subballistic one taking place when the attraction is strong enough. We identify the speed in the former case, and the algebraic rate of escape in the latter case. Finally, we discuss the diffusive behavior in the case of zero drift and weak attraction.
In this note, we prove a quenched functional central limit theorem for a biased random walk on a supercritical Galton-Watson tree with leaves. This extends a result of Peres and Zeitouni (2008) where the case without leaves is considered. A conjecture of Ben Arous and Fribergh (2016) suggests an upper bound on the bias which we observe to be sharp.
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.
We discuss the quenched tail estimates for the random walk in random scenery. The random walk is the symmetric nearest neighbor walk and the random scenery is assumed to be independent and identically distributed, non-negative, and has a power law tail. We identify the long time aymptotics of the upper deviation probability of the random walk in quenched random scenery, depending on the tail of scenery distribution and the amount of the deviation. The result is in turn applied to the tail estimates for a random walk in random conductance which has a layered structure.
We prove a quenched local central limit theorem for continuous-time random walks in $\mathbb Z^d, d\ge 2$, in a uniformly-elliptic time-dependent balanced random environment which is ergodic under space-time shifts. We also obtain Gaussian upper and lower bounds for quenched and (positive and negative) moment estimates of the transition probabilities and asymptotics of the discrete Green function.
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches per vertex. This generalizes and unifies previous work of the authors. It also shows that the point of phase transition for edge-reinforced random walk is likewise determined by the branching number of the tree. Finally, we show that the branching number determines the rate of first-passage percolation on trees, also known as the first-birth problem. Our tech…
It is well known that random walks in one dimensional random environment can exhibit subdiffusive behavior due to presence of traps. In this paper we show that the passage times of different traps are asymptotically independent exponential random variables with parameters forming, asymptotically, a Poisson process. This allows us to prove weak quenched limit theorems in the subdiffusive regime where the contribution of traps plays the dominating role.
We consider biased random walks in a one-dimensional percolation model. This model goes back to Axelson-Fisk and Häggström and exhibits the same phase transition as biased random walk on the infinite cluster of supercritical Bernoulli bond percolation on $\mathbb{Z}^d$, namely, for some critical value $λ_{\mathrm{c}} >0$ of the bias, it holds that the asymptotic linear speed $\overline{\mathrm{v}}$ of the walk is strictly positive if the bias $λ$ is strictly smaller than $λ_{\mathrm{c}}$, whereas $\overline{\mathrm{v}}=0$ if $λ\geq λ_{\mathrm{c}}$. We show that at the critical bias $λ= λ_{\mat…
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 the appropriate invariant measure on the set of tilings. Our tool for this is the corrector method.
We consider random walks on the infinite cluster of a conditional bond percolation model on the infinite ladder graph. In a companion paper, we have shown that if the random walk is pulled to the right by a positive bias $λ> 0$, then its asymptotic linear speed $\overline{\mathrm{v}}$ is continuous in the variable $λ> 0$ and differentiable for all sufficiently small $λ> 0$. In the paper at hand, we complement this result by proving that $\overline{\mathrm{v}}$ is differentiable at $λ= 0$. Further, we show the Einstein relation for the model, i.e., that the derivative of the speed at $λ= 0$ equ…
We consider the rates of convergence of the quenched central limit theorem for hitting times of one-dimensional random walks in a random environment. Previous results had identified polynomial upper bounds for the rates of decay which are sometimes slower than $n^{-1/2}$ (the optimal rate in the classical Berry-Esseen estimates). Here we prove that the previous upper bounds are in fact the best possible polynomial rates for the quenched CLT.
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 principle. This invariance principle holds for point processes which have clustering or repulsiveness properties including Poisson point processes, Mat{é}rn cluster and Mat{é}rn hardcore processes. The method relies on the decomposition of the process into a martingale part and a corrector which is proved to be negligible at the diffusive scale.
We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two points separated by distance $k$ is of the form $c_k/N^{k(1+δ)}, δ>-1$, with $c_k=C_0+C_1\log k+C_2k^α$, non-negative constants $C_0, C_1, C_2$, and $α>0$. Percolation was proved in Dawson and Gorostiza (2013) for $δ<1$, and for the critical case, $δ=1,C_2>0$, with $α>2$. In this paper we improve the result for the critical case by showing percolation for $…
We consider an i.i.d. random environment with a strong form of transience on the two dimensional integer lattice. Namely, the walk always moves forward in the y-direction. We prove a functional CLT for the quenched expected position of the random walk indexed by its level crossing times. We begin with a variation of the Martingale Central Limit Theorem. The main part of the paper checks the conditions of the theorem for our problem.
We prove the quenched version of the central limit theorem for the displacement of a random walk in doubly stochastic random environment, under the $H_{-1}$-condition, with slightly stronger, $L^{2+\varepsilon}$ (rather than $L^2$) integrability condition on the stream tensor. On the way we extend Nash's moment bound to the non-reversible, divergence-free drift case.
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 $γ$ such that: for $γ<1$, the random walk is sub-ballistic (i.e. has zero velocity asymptotically), with polynomial escape rate described by $γ$; whereas for $γ>1$, the random walk is ballistic, with non-zero speed in the direction of the bias. They moreover established, under the usual diffusive scaling about the mean distance travelled by the random walk in the direction of th…
We consider a directed random walk on the backbone of the supercritical oriented percolation cluster in dimensions $d+1$ with $d \ge 3$ being the spatial dimension. For this random walk we prove an annealed local central limit theorem and a quenched local limit theorem. The latter shows that the quenched transition probabilities of the random walk converge to the annealed transition probabilities reweighted by a function of the medium centred at the target site. This function is the density of the unique measure which is invariant for the point of view of the particle, is absolutely continuous…
We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for uniformly elliptic divergence form diffusions, hold with constants c_i depending only on p (the percolation probability) and d. The irregular nature of the medium means that the bound for q_t(x,\cdot) holds only for t\ge S_x(ω), where the constant S_x(ω) depends on the percolation configuration ω.
We consider a random walk in a random potential on a square lattice of arbitrary dimension. The potential is a function of an ergodic environment and some steps of the walk. The potential can be unbounded, but it is subject to a moment assumption whose strictness is tied to the mixing of the environment, the best case being the i.i.d. environment. We prove that the infinite volume quenched point-to-point free energy exists and has a variational formula in terms of an entropy. We establish regularity properties of the point-to-point free energy, as a function of the potential and as a function …
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 of the jumps) we prove a quenched conditional invariance principle for the random walk, under the condition that it remains positive until time $n$. As a corollary of this result, we study the effect of conditioning the random walk to exceed level $n$ before returning to 0 as $n\to \infty$.
We consider a directed random walk on the backbone of the infinite cluster generated by supercritical oriented percolation, or equivalently the space-time embedding of the ``ancestral lineage'' of an individual in the stationary discrete-time contact process. We prove a law of large numbers and an annealed central limit theorem (i.e., averaged over the realisations of the cluster) using a regeneration approach. Furthermore, we obtain a quenched central limit theorem (i.e.\ for almost any realisation of the cluster) via an analysis of joint renewals of two independent walks on the same cluster.
We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G are either open or closed and refresh their status at rate μ while at the same time a random walker moves on G at rate 1 but only along edges which are open. On the d-dimensional torus with side length n, we prove that in the subcritical regime, the mixing times for both the full system and the random walker are n^2/μ up to constants. We also obtain results concerning mean squared displacement and hitting times. Finally, we show that the usual recurrence transience dichotomy for the lattice Z^d…
We initiate the study on chemical distances of percolation clusters for level sets of two-dimensional discrete Gaussian free fields as well as loop clusters generated by two-dimensional random walk loop soups. One of our results states that the chemical distance between two macroscopic annuli away from the boundary for the random walk loop soup at the critical intensity is of dimension 1 with positive probability. Our proof method is based on an interesting combination of a theorem of Makarov, isomorphism theory and an entropic repulsion estimate for Gaussian free fields in the presence of a h…
We consider a bounded step size random walk in an ergodic random environment with some ellipticity, on an integer lattice of arbitrary dimension. We prove a level 3 large deviation principle, under almost every environment, with rate function related to a relative entropy.
Ahlberg, Griffiths, Morris and Tassion have proved that, asymptotically almost surely, the quenched crossing probabilities for critical planar Voronoi percolation do not depend on the environment. We prove an analogous result for arm events. In particular, we prove that the variance of the quenched probability of an arm event is at most a constant times the square of the annealed probability. The fact that the arm events are degenerate and non-monotonic add two major difficulties. As an application, we prove that there exists $ε> 0$ such that the following holds for the annealed percolation fu…
In this paper, we are interested in some questions of Greven and den Hollander about the rate function $I\_η^q$ of quenched large deviations for random walk in random environment. By studying the hitting times of RWRE, we prove that in the recurrent case, $\lim\_{θ\to 0^+}(I\_η^q)''(θ)=+\infty$, which gives an affirmative answer to a conjecture of Greven and den Hollander. We also establish a comparison result between the rate function of quenched large deviations for a diffusion in a drifted Brownian potential, and the rate function for a drifted Brownian motion with the same speed.