Orthogonality and probability: mixing times
classification
🧮 math.PR
keywords
mixingtimesapproachboundingchainsdiagonalizationdiscretedistance
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.