Grinstead-Snell-Probability · Problem 6

Random Walks

Mathematics · random-walks-last-return

Problem

(a) Show that the probability that a random walk of length 2m2m has a last return to the origin at time 2k2k, where 0≤k≤m0 \leq k \leq m, equals (2kk)(2m−2km−k)22m=u2ku2m−2k.\frac{\binom{2k}{k}\binom{2m-2k}{m-k}}{2^{2m}} = u_{2k} u_{2m-2k}. (The case k=0k = 0 consists of all paths that do not return to the origin at any positive time.) Hint: A path whose last return to the origin occurs at time 2k2k consists of two paths glued together, one path of which is of length 2k2k and which begins and ends at the origin, and the other path of which is of length 2m−2k2m - 2k and which begins at the origin but never returns to the origin. Both types of paths can be counted using quantities which appear in this section. (b) Using part (a), show that if mm is odd, the probability that a walk of length 2m2m has no equalization in the last mm outcomes is equal to 1/21/2, regardless of the value of mm. Hint: The answer to part (a) is symmetric in kk and m−km-k.

Related theory

Browse the problem library