English

Exit time for anchored expansion

Probability 2015-07-03 v2

Abstract

Let (Xn)n0(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.

Keywords

Cite

@article{arxiv.0903.3892,
  title  = {Exit time for anchored expansion},
  author = {T. Delmotte and C. Rau},
  journal= {arXiv preprint arXiv:0903.3892},
  year   = {2015}
}

Comments

18 pages, version 2

R2 v1 2026-06-21T12:43:25.162Z