Mixing and shuffling

Mixing in Markov chains is `big business' these days in combinatorics and the theory of computing, because of its importance in approximate sampling and estimation. We will take a look at how some modern techniques (joint work with Laci Lovasz) apply to an ancient mixing problem: how many times should you shuffle a deck of cards? Three different shuffling models lead to two gratifying answers and one stultifying open problem.