arXiv:2304.05878 Abstract | arXiv Analytics

arXiv:2304.05878 [math.PR]Abstract References Reviews Resources

Relaxation times are stationary hitting times of large sets

Published 2023-04-12Version 1

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.

Comments: 27 pages

Categories: math.PR

Subjects: 60J10

Keywords: large sets, stationary hitting times, relaxation time, stationary expected hitting times, absolute constant factor

Related articles: Most relevant | Search more

arXiv:2407.12610 [math.PR] (Published 2024-07-17)

Relaxation time and topology in 1D $O(N)$ models

Pietro Caputo, Sébastien Ott, Assaf Shapira

arXiv:math/0412449 [math.PR] (Published 2004-12-22, updated 2006-10-11)

Relaxation time of $L$-reversal chains and other chromosome shuffles

N. Cancrini, P. Caputo, F. Martinelli

arXiv:math/0308284 [math.PR] (Published 2003-08-28, updated 2004-03-26)