pith. sign in

arxiv: 0903.3892 · v2 · pith:BU4CTAGLnew · submitted 2009-03-23 · 🧮 math.PR

Exit time for anchored expansion

classification 🧮 math.PR
keywords timeanchoredexitrandomapplicationboundscaseconsider
0
0 comments X
read the original abstract

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$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.