Probability theory and stochastic processes Markov processes Concept
Markov chain mixing time
Summary
The mixing time of a finite Markov chain is the number of steps it needs to come close to its stationary distribution. This must hold whatever the starting state. Closeness is measured in total variation distance, usually with threshold . Mixing times measure the cost of Markov chain Monte Carlo and of card shuffling. Their study is a large part of modern Markov chain theory.
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | 8TV1YW8EXC |
|---|---|
| URI | m2://8TV1YW8EXC |
| Kind | concept |
| Writing | W0 stub |
| MSC | 60J10, 60J22 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.