Random walk

A random walk is a mathematical concept known as a stochastic process. It describes a path made of a sequence of random steps through a mathematical space.

This concept helps us model systems where movement is unpredictable. It can describe the path of a molecule in a gas or the way a foraging animal searches for food. It also applies to the fluctuating prices of stocks or the changing money of a gambler. Because of this, random walks are useful in many fields like physics, biology, economics, and computer science.

To understand the mechanism, consider a simple random walk on a one-dimensional integer number line. The walk starts at zero. At each step, the walker moves either +1 or -1 with an equal probability of 50 percent. You can imagine this using a fair coin. If the coin lands on heads, the marker moves one unit to the right. If it lands on tails, it moves one unit to the left.

After several steps, the net distance is the sum of all these individual moves. The expected value of this position is zero, meaning the average position stays at the start as the number of steps increases.

There are different types of random walks based on the space they inhabit. A lattice random walk occurs on a regular grid. In a simple symmetric random walk on a locally finite lattice, the walker jumps to immediate neighbors with equal probability. If the space is limited by boundaries, it is called a simple bordered symmetric random walk. In these cases, the movement is limited when the walker hits a corner or a margin. In higher dimensions, the paths become more complex. A two-dimensional walk might look like a person choosing random sidewalks at city intersections.

History shows how our understanding of these paths has grown. The term "random walk" was first introduced by Karl Pearson in 1905. Later, mathematicians used these models to explore complex probability. One famous example is the gambler's ruin. This describes a gambler with a finite amount of money playing against a bank with infinite money. Because the gambler's money performs a random walk, they will eventually hit zero and lose everything. This is also known as the level-crossing phenomenon or recurrence.

Mathematical patterns emerge from these random movements. For example, the number of different possible walks after $n$ steps is $2^n$. The probabilities of landing on specific numbers are related to Pascal's triangle.

For a walk of five flips, there is only 1 way to land on 5, but 10 ways to land on 1. As the number of steps increases, the distribution of these probabilities approaches a normal distribution. This connection is explained by the central limit theorem. This theorem helps scientists predict how large groups of random steps will behave over time.

Dimensions change the fundamental nature of the walk. In 1921, George Pólya proved that a person walking randomly in a two-dimensional plane will almost surely return to their starting point. However, this changes in three dimensions or higher. In 3D, the probability of returning to the origin drops to approximately 34 percent.

The mathematician Shizuo Kakutani described this by saying a drunk man will find his way home, but a drunk bird may get lost forever. This happens because there are more directions to move, making it harder to stumble back to the start.

Random walks are deeply connected to other scientific ideas. When the steps become extremely small and frequent, the walk becomes a Wiener process. This process is a scaling limit of the random walk. It is also used to model Brownian motion, which is the physical movement of minute particles in a fluid.

Scientists also use Monte Carlo simulations to realize these walks on computers. These simulations allow researchers to study complex biological or engineering systems by mimicking the randomness found in nature.