Monday, June 28, 2010
Monday, June 21, 2010
There are m+1 nodes on a circle numbered 0 to m. You are initially at 0 and with equal probability can jump to one of your neighboring nodes. Find the probability that the i-th node is the last node visited, i.e. what is the probability that when node i is eventually visited for the first time, you have visited every other node at least once before that.