Explores communicating classes in Markov chains, distinguishing between transient and recurrent classes, and delves into the properties of these classes.
Explores the concept of stationary distribution in Markov chains, discussing its properties and implications, as well as the conditions for positive-recurrence.
Introduces Hidden Markov Models, explaining the basic problems and algorithms like Forward-Backward, Viterbi, and Baum-Welch, with a focus on Expectation-Maximization.
Covers Markov processes, transition densities, and distribution conditional on information, discussing classification of states and stationary distributions.
