Metropolis-Hastings Algorithm

This lecture covers the Metropolis-Hastings algorithm and the Glauber algorithm for sampling from the Boltzmann distribution. It explains the iterative rules and updates for the Curie-Weiss model, focusing on the Metropolis-Hastings algorithm's recipe and the Glauber algorithm's differential equations. The lecture also delves into the optimization of the code for computational efficiency and the analytical differential equations for the average magnetization. Through exercises and corrections, the lecture demonstrates the convergence to equilibrium configurations and the impact of finite size effects on the dynamics.