Question: 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
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 thatXnwill take to return to its starting position?
(b)What is the probabilityXnwill visit all the other states before returning to its startingposition?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
