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 properties of Markov chains, including irreducibility, aperiodicity, and recurrence. It also discusses the approximation of Stirling's formula and the concept of hitting time. The lecture delves into the transition probabilities, recurrent states, and absorbing states in Markov chains.
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