Accessible State

From GM-RKB
Jump to navigation Jump to search

See: Markov Process State, Graph Path, Markov Chain, Recurrent State.



References

2011

  • http://en.wikipedia.org/wiki/Markov_chain#Reducibility
    • QUOTE: A state j is said to be accessible from a state i (written ij) if a system started in state i has a non-zero probability of transitioning into state j at some point. Formally, state j is accessible from state i if there exists an integer n ≥ 0 such that [math]\displaystyle{ \Pr(X_{n}=j | X_0=i) = p_{ij}^{(n)} \gt 0.\, }[/math] Allowing n to be zero means that every state is defined to be accessible from itself.

2010