Mixing time estimation in reversible Markov chains from a single sample path
Daniel Hsu, Aryeh Kontorovich, David A. Levin, Yuval Peres, Csaba, Szepesv\'ari

TL;DR
This paper develops a method to estimate the spectral gap and mixing time of a reversible Markov chain from a single observed trajectory, providing data-dependent confidence intervals without prior knowledge of chain parameters.
Contribution
It introduces the first data-driven procedure for estimating the spectral gap and mixing time from a single sample path of a reversible Markov chain.
Findings
Estimates of the spectral gap are accurate with sample size proportional to 1/(γπ*)
Provides confidence intervals for mixing time that do not require prior parameters
Interval width decreases at a rate of 1/√n with sample size n
Abstract
The spectral gap of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix may be unknown, yet one sample of the chain up to a fixed time may be observed. We consider here the problem of estimating from this data. Let be the stationary distribution of , and . We show that if , then can be estimated to within multiplicative constants with high probability. When is uniform on states, this matches (up to logarithmic correction) a lower bound of steps required for precise estimation of . Moreover, we provide the first procedure for computing a fully data-dependent interval, from a single finite-length…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
