Drunkard's walk in a 1-dimensional box Tue Apr 9 17:42:20 PDT 2002 A drunkard is confined to a walkway that is two miles long, and has a wall at each end. The drunkard's walk is in phases, where in each phase he walks for a while in one direction. At each phase, the drunkard picks a direction uniformly at random. He also picks a distance d to walk using an exponential distribution with mean 1; i.e., for any given t >= 0, the probability that he chooses d > t is e^{-t}. The drunkard then attempts to walk that distance in the chosen direction. When he has walked that distance he stops, ending the phase. If the drunkard encounters the wall at the end of the walkway during a phase, he doesn't notice, but just keeps marching in place for the appropriate number of steps, then stops, ending the phase. Problems. 1. Let pi^i be the distribution of the drunkard after i phases. Prove that, as i goes to infinity, pi^i converges to a unique stationary distribution pi that does not depend on the initial distribution pi^0. 2. What is the probability (in the long run) that the drunkard will end a given phase at a wall? 3. The walkway consists of a sequence of stones one step apart. Prove that, except for the two stones at the ends, the drunkard steps on all stones equally often in the long run. 4. In the long run, how often does the drunkard step on a given end stone (measured as a proportion of the total number of steps)? The answer should be given in a limiting sense, i.e., as a constant times epsilon, where epsilon is the size of one stone in miles, which is taken as infinitesimal. 5. In the long run, what proportion of the time is the drunkard is trying to walk into a wall?