Chen, Dayue and Peres, Yuval - The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview

dmtcs:3340 - Discrete Mathematics & Theoretical Computer Science, January 1, 2003, DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
The Speed of Simple Random Walk and Anchored Expansion on Percolation Clusters: an Overview

Authors: Chen, Dayue and Peres, Yuval

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.


Source : oai:HAL:hal-01183935v1
Volume: DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Section: Proceedings
Published on: January 1, 2003
Submitted on: May 10, 2017
Keywords: anchored expansion constant.,Cayley graphs,percolation,random walks,speed,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]


Share

Browsing statistics

This page has been seen 11 times.
This article's PDF has been downloaded 16 times.