In mathematics, a random walk is a random process that describes a path that consists of a succession of discrete, random steps on some mathematical space. In a random walk, the final position is entirely independent of the point of origin of the object. Additionally, it is an example of the Markov Process.
Examples of random walk include:
- one-dimensional random walk: where an integer Z on the number line starts at 0, and at each step moves +1 or -1 with equal probability
- brownian motion: the path traced by a molecule as it travels in a liquid or a gas
The blue, green & orange plots represent three distinct runs of the algorithm.
samarthkulshrestha/random_walk is licensed under the MIT License.
Copyright (c) 2023 Samarth Kulshrestha.