# random walk
A random walk is a sequence of steps whose direction is decided by chance at every turn — and it turns out to describe an enormous range of real phenomena, from pollen grains jittering in water to how web pages get ranked. This tag brings together the site's stochastic-process simulations: Brownian Motion for the physical original, Markov Chains and Markov Chain — Transition Matrix Simulator for state-based randomness, Gambler's Ruin for a walk with absorbing boundaries, Lévy Flight for heavy-tailed step sizes, and PageRank, which famously models a "random surfer" clicking links. Filter by this tag whenever you want randomness that accumulates into structure.
Found: 9 simulations · 1 articles
🧪 Simulations (9)
📖 Articles (1)
Simulations in this topic include Brownian Motion — Nanoparticle Diffusion Simulator, Markov Chains, Markov Chain — Transition Matrix Simulator, Polymer Chain, Gambler's Ruin and Lévy Flight.
📊 Facts about this collection
- 10 items total — 9 simulations plus the article Random Walks & Brownian Motion.
- Markov-chain modelling appears twice, in Markov Chains and Markov Chain — Transition Matrix Simulator.
- PageRank is the only sim here applying a random walk to a real-world algorithm rather than a physical or gambling process.
- Diffusion-Limited Aggregation and Polymer Chain show random walks building up physical structure step by step.
Looking for more? Dive into the full library of 1000+ interactive, browser-based simulations, or browse every topic.