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 concepts of positive and null-recurrence in Markov chains, defining the first recurrence time to a state, mean recurrence time, and equivalence classes. It explains that in an equivalence class, all states are either transient, positive-recurrent, or null-recurrent, with examples provided.