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 topic of discrete-time Markov chains, focusing on the concept of first passage time. It discusses the probability of reaching a certain state for the first time starting from a given initial state. The lecture explores the calculation of these probabilities and provides examples to illustrate the concept. It also delves into the minimal solutions for these scenarios and the implications of different initial conditions on the passage times.
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