Exit time for anchored expansion

preprint2015arXivOpen access

Abstract

Let (Xn)n≥0(X_n)_{n\geq 0} be a reversible random walk on a graph GG 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 Zd\Z^d.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.