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
![Random walk - Wikipedia](https://cdn-ak-scissors.b.st-hatena.com/image/square/6d56c78e1e6be7f7d688147b306677e7744c0bc5/height=288;version=1;width=512/https%3A%2F%2Fupload.wikimedia.org%2Fwikipedia%2Fcommons%2Fthumb%2F3%2F3a%2FStandard_deviation_diagram_micro.svg%2F1200px-Standard_deviation_diagram_micro.svg.png)