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. Topics include ergodic chains, examples of irreducible, ergodic, aperiodic, and recurrent positive chains. The lecture also discusses stationary distribution, transition probabilities, and properties of Markov chains.