Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview

Abstract : Benjamini, Lyons and Schramm (1999) considered properties of an infinite graph $G$, and the simple random walk on it, that are preserved by random perturbations. To address problems raised by those authors, we study simple random walk on the infinite percolation cluster in Cayley graphs of certain amenable groups known as "lamplighter groups''.We prove that zero speed for 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. 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; 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.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 12, 2015 - 9:07:51 AM
Last modification on : Wednesday, August 7, 2019 - 12:19:23 PM
Long-term archiving on: : Friday, November 13, 2015 - 11:37:54 AM


Publisher files allowed on an open archive




Dayue Chen, yuval Peres. The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview. Discrete Random Walks, DRW'03, 2003, Paris, France. pp.39-44, ⟨10.46298/dmtcs.3340⟩. ⟨hal-01183935⟩



Record views


Files downloads