Five eight-step random walks from a central point. Some paths appear shorter than eight steps where the route has doubled back on itself. (animated version) In mathematics, a random walk, sometimes known as a drunkard's walk, is a random process that describes a path that consists of a succession of random steps on some mathematical space. An elementary example of a random walk is the random walk