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:
“Novels as dull as dishwater, with the grease of random sentiments floating on top.”
—Italo Calvino (1923–1985)
“No annual training or muster of soldiery, no celebration with its scarfs and banners, could import into the town a hundredth part of the annual splendor of our October. We have only to set the trees, or let them stand, and Nature will find the colored drapery,—flags of all her nations, some of whose private signals hardly the botanist can read,—while we walk under the triumphal arches of the elms.”
—Henry David Thoreau (1817–1862)