Abstract
Let be a reversible random walk on a graph 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 .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.