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 concept of hitting probabilities in Markov chains, including the minimal non-negative solution of the system, the proof of hitting probabilities, and the recursive relationships. It also delves into the calculation of hitting times and the properties of the hitting probabilities.