Relaxation times are stationary hitting times of large sets

Abstract

We give a characterization of the relaxation time up to an absolute constant factor, in terms of stationary expected hitting times of large sets. This resolves a conjecture of Aldous and Fill. We give a similar characterization for the spectral profile. We also provide in the non-reversible setup a related characterization for stationary expected hitting times of large sets.