Description:

  • For a pair of state , let be probability that the Markov chain, starting in the state , will ever make a transition into state .
  • That is,
  • Proposition: If state is recurrent and communicates with state , then
    • meaning the process will eventually enter state with probablity 1, sooner or later
  • If state is recurrent
    • Let denotes the expected number of transitions it takes the markov chain when starting from to get to state again
    • With
      • number of transition to from any state
      • expected number of transitions until first met , starting from
    • The recurrent state is positive recurrent if
    • And is null recurrent if meaning there must be infinite steps before it comes back to itself
  • If the Markov chain is irreducible and recurrent, then for any initial state
    • where denotes the long-run proportion of time that the Markov chain is in state
  • If is positive recurrent and then is Positive recurrent
    • it follows that null recurrentce is also a class property
    • An irreducible finite state MC must be Positive recurrent
  • theorem : Consider an irreducible MC. If the chain is positive recurrent then the long-run proportions are the unique solution of the equations: and
    • long-run proportion of transitions that go from state to state
    • So the long run ratio of state is sum of each state’s long-run proportion times probability of transitioning to
    • Moreover, if there is no solution of the preceding linear equation, then the MC is either transient or Null recurrent and all

Another prove:

  • For stationary distribution in AI
  • Let