Concentration of measure and mixing for Markov chains
classification
🧮 math.PR
math.CO
keywords
chainsconcentrationmarkovmeasureapplicationscomputerconditionsconsider
read the original abstract
We consider Markovian models on graphs with local dynamics. We show that, under suitable conditions, such Markov chains exhibit both rapid convergence to equilibrium and strong concentration of measure in the stationary distribution. We illustrate our results with applications to some known chains from computer science and statistical mechanics.
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.