A random walk is a mathematical object describing a path formed by a sequence of random steps, in its simplest form a sequence of positions on the integers that moves one step left or right with equal probability at each turn. The term itself was coined by the statistician Karl Pearson in a 1905 letter to the journal Nature, in which he asked for the probability that a person taking a fixed number of steps of random direction would end up within a given distance of the starting point, though closely related problems, such as the gambler's ruin, had already been studied for centuries. As the number of steps grows large, a simple random walk's rescaled path converges to Brownian motion, making the random walk the natural discrete counterpart of that continuous process, and random walks are used throughout physics, biology, computer science and finance to model diffusion, foraging behavior, search algorithms and the fluctuation of prices.
Facts
Connections
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Wikipedia: Random walk
Lead sectionQuote, Lead section
The term random walk was first introduced by Karl Pearson in 1905.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.