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

  1. Lecture 1: introduction and probability review
  2. Lecture 2: more review the bernoulli process
  3. Lecture 3: law of large numbers convergence
  4. Lecture 4: poisson the perfect arrival process
  5. Lecture 5: poisson combining and splitting
  6. Lecture 6: from poisson to markov
  7. Lecture 7: finite state markov chains the matrix approach
  8. Lecture 8: markov eigenvalues and eigenvectors
  9. Lecture 9: markov rewards and dynamic programming
  10. Lecture 10: renewals and the strong law of large numbers
  11. Lecture 11: renewals strong law and rewards
  12. Lecture 12: renewal rewards stopping trials and walds inequality
  13. Lecture 13: little m g 1 ensemble averages
  14. Lecture 14: review
  15. Lecture 15: the last renewal
  16. Lecture 16: renewals and countable state markov
  17. Lecture 17: countable state markov chains
  18. Lecture 18: countable state markov chains and processes
  19. Lecture 19: countable state markov processes
  20. Lecture 20: markov processes and random walks
  21. Lecture 21: hypothesis testing and random walks
  22. Lecture 22: random walks and thresholds
  23. Lecture 23: martingales plain sub and super
  24. Lecture 24: martingales stopping and converging
  25. 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