For reversible finite Markov chains, the L-infinity mixing time is at most trel log(e thit / trel), so the mixing time is comparable to the maximal hitting time exactly when the spectral gap times the hitting time remains bounded; this resolves the Aldous-Fill coalescence conjecture under…
Unfinished manuscript
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Some inequalities for reversible Markov chains and branching random walks via spectral optimization
For reversible finite Markov chains, the L-infinity mixing time is at most trel log(e thit / trel), so the mixing time is comparable to the maximal hitting time exactly when the spectral gap times the hitting time remains bounded; this resolves the Aldous-Fill coalescence conjecture under…