Question: Random walk on a clock. Consider the numbers 1; 2; : : : 12 written around a ring as they usually are on a clock.
Random walk on a clock. Consider the numbers 1; 2; : : : 12 written around a ring as they usually are on a clock. Consider a Markov chain that at any point jumps with equal probability to the two adjacent numbers. (a)What is the expected number of steps that Xn will take to return to its starting position? (b)What is the probability Xn will visit all the other states before returning to its starting position?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
