L26.8 Mean First Passage Time

MIT OpenCourseWare
24 Apr 201808:44

Summary

TLDRIn this video, the focus is on analyzing the mean first passage time in Markov chains, specifically how long it takes to reach a recurrent state for the first time. The script explores the concept of recurrent and transient states, with an emphasis on calculating the expected time to reach a specific state (state 9) from any given initial state. The discussion extends to related concepts such as mean recurrence time, examining the random nature of these processes and how different transitions affect the calculation. The video uses a simple Markov chain model to illustrate these ideas and solve related problems.

Takeaways

  • πŸ˜€ The Markov chain in the video consists of a recurrent class and transient states, with an interest in calculating the time to reach a specific recurrent state (e.g., state 9).
  • πŸ˜€ The goal is to determine how long it will take to reach state 9 from an initial state, such as state 1, and this is framed as a random variable.
  • πŸ˜€ The mean first passage time is the expected number of steps required for a Markov chain to reach state 9 from any starting state, including state 1.
  • πŸ˜€ After visiting state 9, the chain's future transitions are irrelevant to the calculation of the first passage time to state 9.
  • πŸ˜€ To simplify the problem, we remove arcs from the Markov chain that would require passing through state 9 again, and adjust the transition probabilities accordingly.
  • πŸ˜€ After simplifying the chain, state 9 becomes an absorbing state, meaning once the chain reaches state 9, it stays there permanently.
  • πŸ˜€ The expected time to reach an absorbing state can be calculated using a system of equations derived from the modified transition graph.
  • πŸ˜€ The mean recurrence time of state 9 is the expected number of steps for the Markov chain to return to state 9 after leaving it.
  • πŸ˜€ The mean recurrence time is calculated similarly to the mean first passage time, but with a focus on transitions from state 9 and the expected time until the chain returns to 9.
  • πŸ˜€ The calculation for the mean recurrence time involves setting up a system where the recurrence time is the sum of the transition probabilities to other states and their respective mean first passage times, plus 1 for the initial step.
The video is abnormal, and we are working hard to fix it.
Please replace the link and try again.

Outlines

plate

This section is available to paid users only. Please upgrade to access this part.

Upgrade Now

Mindmap

plate

This section is available to paid users only. Please upgrade to access this part.

Upgrade Now

Keywords

plate

This section is available to paid users only. Please upgrade to access this part.

Upgrade Now

Highlights

plate

This section is available to paid users only. Please upgrade to access this part.

Upgrade Now

Transcripts

plate

This section is available to paid users only. Please upgrade to access this part.

Upgrade Now
Rate This
β˜…
β˜…
β˜…
β˜…
β˜…

5.0 / 5 (0 votes)

Related Tags
Markov chainsstochastic processesrecurrence timefirst passage timemathematical modelingprobability theoryrecurrent statesexpected valuetransient statesrandom variables