Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the lower bound on the total variation distance in ergodic Markov chains with finite state space and detailed balance. It explores the quest for a matching lower bound under various assumptions and additional conditions, providing theorems and proofs. The lecture concludes with examples of cyclic random walks and their implications on mixing time.