Lattice Random Walk
A popular random walk model is that of a random walk on a regular lattice, where at each step the location jumps to another site according to some probability distribution. In a simple random walk, the location can only jump to neighboring sites of the lattice. In simple symmetric random walk on a locally finite lattice, the probabilities of the location jumping to each one of its immediate neighbours are the same. The best studied example is of random walk on the d-dimensional integer lattice (sometimes called the hypercubic lattice) .
Read more about this topic: Random Walk
Famous quotes containing the words random and/or walk:
“Assemble, first, all casual bits and scraps
That may shake down into a world perhaps;
People this world, by chance created so,
With random persons whom you do not know—”
—Robert Graves (1895–1985)
“Children crawl before they walk, walk before they run—each generally a precondition for the other. And with each step they take toward more independence, more mastery of the environment, their mothers take a step away—each a small separation, a small distancing.”
—Lillian Breslow Rubin (20th century)