MIT · Computer Science
6.262 Discrete Stochastic Processes
Robert Gallager · 2011 · 25 free video lectures
Discrete stochastic processes are essentially probabilistic systems that evolve in time via random changes occurring at discrete fixed or random intervals. This course aims to help students acquire both the mathematical principles and the intuition necessary to create, analyze, and understand…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Lecture 1: introduction and probability review
- Lecture 2: more review the bernoulli process
- Lecture 3: law of large numbers convergence
- Lecture 4: poisson the perfect arrival process
- Lecture 5: poisson combining and splitting
- Lecture 6: from poisson to markov
- Lecture 7: finite state markov chains the matrix approach
- Lecture 8: markov eigenvalues and eigenvectors
- Lecture 9: markov rewards and dynamic programming
- Lecture 10: renewals and the strong law of large numbers
- Lecture 11: renewals strong law and rewards
- Lecture 12: renewal rewards stopping trials and walds inequality
- Lecture 13: little m g 1 ensemble averages
- Lecture 14: review
- Lecture 15: the last renewal
- Lecture 16: renewals and countable state markov
- Lecture 17: countable state markov chains
- Lecture 18: countable state markov chains and processes
- Lecture 19: countable state markov processes
- Lecture 20: markov processes and random walks
- Lecture 21: hypothesis testing and random walks
- Lecture 22: random walks and thresholds
- Lecture 23: martingales plain sub and super
- Lecture 24: martingales stopping and converging
- Lecture 25: putting it all together
From MIT OpenCourseWare · CC BY-NC-SA 4.0. More from MIT.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights