What keeps a fair game from spinning out of control? How can we be sure that a random process that wanders without direction will eventually settle down? In this chapter we meet three powerful tools—maximal inequalities, a convergence theorem, and a new lens on randomness called Markov chains—that let us answer questions like these with confidence.