Question: Prove that, in an r-state ergodic chain, it is possible to go from any state to any other state in at most r 1 steps.
Prove that, in an r-state ergodic chain, it is possible to go from any state to any other state in at most r − 1 steps.
Step by Step Solution
3.46 Rating (159 Votes )
There are 3 Steps involved in it
To each Markov chain we can associate a directed graph whose ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
M-S-M-C (20).docx
120 KBs Word File
