Find if markov chain is irreducible aperiodic recurrent
Answers
Answered by
1
If all the states in the Markov Chain belong to one closed communicating class, then the chain is called an irreducible Markov chain. Irreducibility is a property of the chain. In an irreducible Markov Chain, the process can go from any state to any state, whatever be the number of steps it requires.
Answered by
0
Answer:
Explanation:
If all the states in the Markov Chain belong to one closed communicating class, then the chain is called an irreducible Markov chain. Irreducibility is a property of the chain. In an irreducible Markov Chain, the process can go from any state to any state, whatever be the number of steps it requires.
Similar questions