Resources

• Videos and notes from summer school on New Tools for Optimal Mixing of Markov Chains: Spectral Independence and Entropy Decay (organized by Daniel Stefankovic, Prasad Tetali, and Eric Vigoda)
• Markov Chains and Mixing Times (by David Levin, Yuval Peres, and Elizabeth Wilmer)
• Combinatorics and Complexity of Partition Functions (by Alexander Barvinok)
• Notes on Sampling and Counting (by Alan Frieze)
• Mathematical Aspects of Mixing Times in Markov Chains (by Ravi Montenegro and Prasad Tetali)
• Lecture notes on Probability and Computation (by Costis Daskalakis)
• Lecture notes on Counting and Sampling (by Shayan Oveis Gharan)
• Lecture notes on Markov Chain Monte Carlo Methods (by Eric Vigoda)
• Lecture notes on Markov Chain Monte Carlo Algorithms (by Dana Randall)
• Lecture note on Counting Complexity (by Luca Trevisan)
• Lecture notes on Probability Theory: The Coupling Method (by Frank den Hollander)