Lecture
Hitting Times: Examples
In course
DEMO: excepteur commodo minim
Eiusmod eu laboris labore voluptate laboris. Incididunt exercitation ea elit eu. Mollit adipisicing duis dolore ullamco. Consectetur occaecat duis ipsum ipsum est eiusmod.
Description
This lecture covers examples related to hitting times in Markov chains, starting with a simple state space of four points and then moving on to more complex scenarios involving infinite state spaces and snakes and ladders. The instructor demonstrates how to calculate the probabilities of hitting specific states and the expected number of steps before reaching a certain state.
Instructor
labore ipsum pariatur mollit
Enim aute tempor ut dolore culpa ut cupidatat duis irure qui pariatur. Ea deserunt laboris veniam id eiusmod elit aliquip dolore minim eiusmod eu occaecat esse. Dolor non elit elit et aliqua nisi laboris.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related lectures (31)
NISQ and IBM Q
Explores NISQ devices and IBM Q, covering noisy quantum circuits, qubit technologies, and quantum algorithm development.
Expected Number of Visits in State
Covers the criterion for recurrence in infinite chains based on the expected number of visits in a state.
Random Variables and Expected Value
Introduces random variables, probability distributions, and expected values through practical examples.
Stochastic Models for Communications: Discrete-Time Markov Chains - First Passage Time
Explores discrete-time Markov chains, emphasizing first passage time probabilities and minimal solutions.
Sunny Rainy Source: Markov Model
Explores a first-order Markov model using a sunny-rainy source example, demonstrating how past events influence future outcomes.