Percolation Perturbations in Potential Theory and Random Walks
arXiv:math/9804010
Abstract
We show that on a Cayley graph of a nonamenable group, almost surely the infinite clusters of Bernoulli percolation are transient for simple random walk, that simple random walk on these clusters has positive speed, and that these clusters admit bounded harmonic functions. A principal new finding on which these results are based is that such clusters admit invariant random subgraphs with positive isoperimetric constant. We also show that percolation clusters in any amenable Cayley graph almost surely admit no nonconstant harmonic Dirichlet functions. Conversely, on a Cayley graph admitting nonconstant harmonic Dirichlet functions, almost surely the infinite clusters of -Bernoulli percolation also have nonconstant harmonic Dirichlet functions when is sufficiently close to 1. Many conjectures and questions are presented.
29 pages. For related papers, see the authors' WWW pages. Benjamini: http://www.wisdom.weizmann.ac.il/~itai Lyons: http://php.indiana.edu/~rdlyons Schramm: http://www.wisdom.weizmann.ac.il/~schramm
Cited by in corpus (15)
- Random walks on supercritical percolation clusters
- Disorder, entropy and harmonic functions
- Unimodular Random Trees
- Anchored expansion and random walk
- Anchored expansion, percolation and speed
- The non-amenability of Schreier graphs for infinite index quasiconvex subgroups of hyperbolic groups
- Stationary Measures for Random Walks in a Random Environment with Random Scenery
- Percolation beyond ${\mathbb{Z}}^{\bolds{d}}$: The contributions of Oded Schramm
- Processes on Unimodular Random Networks
- Exit time for anchored expansion
- Amenability of horocyclic products of percolation trees
- Counting minimal cutsets and
- Bootstrap percolation on infinite trees and non-amenable groups
- Induced graphs of uniform spanning forests
- A note on the structure of expanders