SCCI Digital Library and Forum

scci library
Menu
Home » Applied Sciences » Engineering » Electrical Engineering and Computer Science (M-I-T) » Introduction to Probability (Spring 2018) (M-I-T) » Part III: Random Processes (M-I-T) » Lecture 24: Finite-State Markov Chains (M-I-T)

Lecture 24: Finite-State Markov Chains (M-I-T)

S# Lecture Course Institute Instructor Discipline
1
L24.1 Lecture Overview (M-I-T)
Lecture 24: Finite-State Markov Chains (M-I-T) MIT Prof. John Tsitsiklis, Prof. Patrick Jaillet Applied Sciences
2
L24.2 Introduction to Markov Processes (M-I-T)
Lecture 24: Finite-State Markov Chains (M-I-T) MIT Prof. John Tsitsiklis, Prof. Patrick Jaillet Applied Sciences
3
L24.3 Checkout Counter Example (M-I-T)
Lecture 24: Finite-State Markov Chains (M-I-T) MIT Prof. John Tsitsiklis, Prof. Patrick Jaillet Applied Sciences
4
L24.4 Discrete-Time Finite-State Markov Chains (M-I-T)
Lecture 24: Finite-State Markov Chains (M-I-T) MIT Prof. John Tsitsiklis, Prof. Patrick Jaillet Applied Sciences
5
L24.5 N–Step Transition Probabilities (M-I-T)
Lecture 24: Finite-State Markov Chains (M-I-T) MIT Prof. John Tsitsiklis, Prof. Patrick Jaillet Applied Sciences
6
L24.6 A Numerical Example — Part I (M-I-T)
Lecture 24: Finite-State Markov Chains (M-I-T) MIT Prof. John Tsitsiklis, Prof. Patrick Jaillet Applied Sciences
7
L24.7 Generic Convergence Questions (M-I-T)
Lecture 24: Finite-State Markov Chains (M-I-T) MIT Prof. John Tsitsiklis, Prof. Patrick Jaillet Applied Sciences
8
L24.8 Recurrent and Transient States (M-I-T)
Lecture 24: Finite-State Markov Chains (M-I-T) MIT Prof. John Tsitsiklis, Prof. Patrick Jaillet Applied Sciences