Exit time for anchored expansion

Abstract

Let $(X_n{)}_{n\ge 0}$ be a reversible random walk on a graph $G$ satisfying an anchored isoperimetric inequality. We give upper bounds for exit time (and occupation time in transient case) by X of any set which contains the root. As an application, we consider random environments of ${\mathbb{Z}}^d$.

18 pages, version 2

References in corpus (3)

• Random walks on supercritical percolation clusters
• Percolation Perturbations in Potential Theory and Random Walks
• Anchored expansion and random walk