Anchored expansion, percolation and speed

Benjamini, Lyons and Schramm [Random Walks and Discrete Potential Theory (1999) 56-84] considered properties of an infinite graph G, and the simple random walk on it, that are preserved by random perturbations. In this paper we solve several problems raised by those authors. The anchored expansion constant is a variant of the Cheeger constant; its positivity implies positive lower speed for the simple random walk, as shown by Virag [Geom. Funct. Anal. 10 (2000) 1588-1605]. We prove that if G has a positive anchored expansion constant, then so does every infinite cluster of independent percolation with parameter p sufficiently close to 1; a better estimate for the parameters p where this holds is in the Appendix. We also show that positivity of the anchored expansion constant is preserved under a random stretch if and only if the stretching law has an exponential tail. We then study a simple random walk in the infinite percolation cluster in Cayley graphs of certain amenable groups known as lamplighter groups. We prove that zero speed for a random walk on a lamplighter group implies zero speed for random walk on an infinite cluster, for any supercritical percolation parameter p. For p large enough, we also establish the converse.

[1]  Y. Peres,et al.  Transience of percolation clusters on wedges , 2002, math/0206130.

[2]  B. Virág Anchored expansion and random walk , 2001, math/0102199.

[3]  Olle Häggström,et al.  The Ising model on diluted graphs and strong amenability , 2000 .

[4]  W. Woess Random walks on infinite graphs and groups, by Wolfgang Woess, Cambridge Tracts , 2001 .

[5]  O. Schramm,et al.  Indistinguishability of Percolation Clusters , 1998, math/9811170.

[6]  I. Benjamini,et al.  Percolation Perturbations in Potential Theory and Random Walks , 1998, math/9804010.

[7]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[8]  Random walks on the lamplighter group , 1996 .

[9]  I. Benjamini,et al.  Percolation Beyond $Z^d$, Many Questions And a Few Answers , 1996 .

[10]  Russell Lyons,et al.  Ergodic theory on Galton—Watson trees: speed of random walk and dimension of harmonic measure , 1995, Ergodic Theory and Dynamical Systems.

[11]  Yu Zhang,et al.  Random walk on the infinite cluster of the percolation model , 1993 .

[12]  Russell Lyons,et al.  Random Walks, Capacity and Percolation on Trees , 1992 .

[13]  Carsten Thomassen,et al.  Isoperimetric Inequalities and Transient Random Walks on Graphs , 1992 .

[14]  R. Burton,et al.  Density and uniqueness in percolation , 1989 .

[15]  N. Varopoulos,et al.  Long range estimates for markov chains , 1985 .

[16]  Vadim A. Kaimanovich,et al.  Random Walks on Discrete Groups: Boundary and Entropy , 1983 .

[17]  H. Kesten Percolation theory for mathematicians , 1982 .

[18]  T. E. Harris,et al.  The Theory of Branching Processes. , 1963 .