For any discrete Markov chain one can construct deterministic “rotor-router” analogues. Such an analogue typically has many of the same properties as the random process it mimics but is more sharply concentrated around its average-case behavior. I will discuss the general theory of derandomization of Markov chains via rotor-routers, as well as the particular example of walk in...