T. Delmotte, C. Rau
Published 2009-03-23, updated 2015-07-02Version 2
Let $(X_n)_{n\geq 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 $\Z^d$.
Comments: 18 pages, version 2
A zero-one law for random walks in random environments on $\mathbb{Z}^2$ with bounded jumps
Random walks in random environments without ellipticity
Variational principles of the exit time for Hunt processes generated by semi-Dirihclet forms
![QR code for arXiv:0903.3892 [math.PR]](http://oss.arxitics.com/images/favicon.svg)