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

1 Expert Approved Answer
Step: 1 Unlock

To each Markov chain we can associate a directed graph whose ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

M-S-M-C (20).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!