Thursday February 2nd at 4pm

graph. Instead of distributing chips to randomly chosen neighbors, it serves the neighbors in a fixed order.

We investigate how well this process simulates a random walk. For the graph being the infinite path, we show that, independent of the

starting configuration, at each time and on each vertex, the number of chips on this vertex deviates from the expected number of chips

in the random walk model by at most a constant

a difference of

Joint work with Benjamin Doerr, Joel Spencer, and Gabor Tardos.