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 recurrence and transience in Markov chains, defining them and providing examples. It explains how to determine if a state is recurrent or transient, highlighting the distinction between the two. The lecture also delves into the behavior of infinite chains, discussing first return times and providing proofs for the discussed concepts.