This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: A set of states S in a Markov chain is a closed set if no state outside of S is reachable from any state in S . Based on the graphical representation, the following sets of states constitute closed sets: {1, 3, 5} {2, 6} d Is this chain ergodic? If all states in a chain are recurrent, aperiodic, and communicate with each other, the chain is said to be ergodic. Since 4 is transient, not all states in the chain are recurrent. No, the chain is not ergodic. page 2...
View
Full Document
 Spring '07
 JosephGeunes
 Markov chain, graphical representation

Click to edit the document details