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?

Answer rating: 100% (QA)

a This is a From Dt TO 1 3 5 S Stochastic 12 x 12 markov doubly model The onestep tran... View the full answer