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 delves into the concepts of transience and recurrence in Markov chains, focusing on finite Markov chains, communicating classes, birth and death chains, and random walks. The instructor explains the conditions under which a chain is transient or recurrent, providing detailed examples and calculations to illustrate these concepts.