Markov Chains for Computer Science: MCMC, Mixing Times, and Randomized AlgorithmsA rigorous treatment of Markov chains from a computer science perspective—Metropolis-Hastings, coupling bounds, spectral gaps, and the role of rapid mixing in modern randomized algorithms.
