Given a cube and a random walker on the cube, find the expected value of the # of steps that the random walker takes to reach the opposite vertex of the cube.
Anonymous
Originally this markov processes has 7 states, since there are 7 vertices on the tube except the opposite vertex. However, the 7 states can be reduced to 3 due to symmetry: Vertices that is 1, 2 and 3 step(s) away from the opposite. The symmetric property is pretty obvious. Now by markov property: E[3] = 1/3 * (E[2] + 1) * 3 (starting vertex can only access vertices 2 steps away from it) E[2] = 1/3 * (E[1] + 1) * 2 + 1/3 * (E[3] + 1) E[1] = 1/3 + 1/3 * (E[2] + 1) * 2 (opposite vertex is absorbing state) These give E[1] = 7, E[2] = 9, E[3] = 10. So 10 steps.
Check out your Company Bowl for anonymous work chats.