Lecture
Stochastic Models for Communications: Discrete-Time Markov Chains - First Passage Time
Related lectures (66)
Discrete-Time Markov Chains: Definitions
Covers the definitions and state probabilities of discrete-time Markov chains.
Hidden Markov Models: Primer
Introduces Hidden Markov Models, explaining the basic problems and algorithms like Forward-Backward, Viterbi, and Baum-Welch, with a focus on Expectation-Maximization.
Explosions in Markov Chains
Explores explosions in Markov chains, analyzing conditions for explosiveness and the impact of chain parameters.
Markov Chains: Challenges and Surprises
Explores challenges and surprises in Markov chains, analyzing convergence, state grouping, and transition probabilities.
Markov Chains: States Classification
Explores Markov chains' states classification, hitting probabilities, and expected durations in various scenarios.
Lindblad equation
Covers the interpretation of the Lindblad equation and its unitary part in quantum gases.
Hitting Times: Examples
Explores hitting times in Markov chains through various examples and scenarios.
Markov Chains: Ergodicity and Stationary Distribution
Explores ergodicity and stationary distribution in Markov chains, emphasizing convergence properties and unique distributions.
Markov Chains: Theory and Applications
Covers the theory and applications of Markov chains in modeling random phenomena and decision-making under uncertainty.
Markov Chains: Recurrence and Transience
Explores first passage times, strong Markov property, and state recurrence/transience in Markov chains.