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 stochastic models for communications, focusing on discrete-time Markov chains with examples of ergodic chains. It explains the concepts of ergodicity, periodicity, and positive recurrence in the context of Markov chains.
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