The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview
The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview
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 …