Let (Xn)n1 be a Markov chain with state space f1; : : : ; kg for some k 1. Show that
if i and j communicate, then the probability that the chain started in state i reaches
state j in k steps or fewer is greater than 0.
Let (Xn)n1 be a Markov chain with state space f1; : : : ; kg for some k 1. Show that
if i and j communicate, then the probability that the chain started in state i reaches
state j in k steps or fewer is greater than 0.
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.