Lecture
This lecture covers the Metropolis-Hastings algorithm, explaining how to choose a Markov process, initialize the chain, simulate the next state, and work in the log-space. It also presents a case study on Swissmetro transportation mode choice model with variables, data collection, and Python code implementation.