Lecture
Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.
This lecture covers the Markov Chain Monte Carlo method, focusing on the Metropolis-Hastings algorithm. It explains how to generate samples from a target probability distribution using this algorithm, constructing a transition kernel. The lecture also discusses the detailed balance condition and the importance of density functions in the process.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace