Help | Contact Us
Home » Courses » Electrical Engineering and Computer Science » Discrete Stochastic Processes » Video Lectures » Lecture 18: Countable-state Markov Chains and Processes
Flash and JavaScript are required for this feature.
Download the video from iTunes U or the Internet Archive.
Description: In this lecture, the professor covers sample-time M/M/1 queue, Burke’s theorem, branching processes, and Markov processes with countable state spaces.
Instructor: Prof. Robert Gallager
Lecture 1: Introduction and...
Lecture 2: More Review; The...
Lecture 3: Law of Large Num...
Lecture 4: Poisson (The Per...
Lecture 5: Poisson Combinin...
Lecture 6: From Poisson to ...
Lecture 7: Finite-state Mar...
Lecture 8: Markov Eigenvalu...
Lecture 9: Markov Rewards a...
Lecture 10: Renewals and th...
Lecture 11: Renewals: Stron...
Lecture 12: Renewal Rewards...
Lecture 13: Little, M/G/1, ...
Lecture 14: Review
Lecture 15: The Last Renewal
Lecture 16: Renewals and Co...
Lecture 17: Countable-state...
Lecture 18: Countable-state...
Lecture 19: Countable-state...
Lecture 20: Markov Processe...
Lecture 21: Hypothesis Test...
Lecture 22: Random Walks an...
Lecture 23: Martingales (Pl...
Lecture 24: Martingales: St...
Lecture 25: Putting It All ...
Countable-state Markov Chains and Processes (PDF)