Orthogonality and probability: mixing times
Probability
2009-10-16 v1
Abstract
We produce the first example of bounding total variation distance to stationarity and estimating mixing times via orthogonal polynomials diagonalization of discrete reversible Markov chains, the Karlin-McGregor approach.
Cite
@article{arxiv.0910.2722,
title = {Orthogonality and probability: mixing times},
author = {Yevgeniy Kovchegov},
journal= {arXiv preprint arXiv:0910.2722},
year = {2009}
}