Deterministic Random Walks

by Tobias Friedrich


Friedrich-Schiller-Universität Jena

The picture shows a deterministic analogue of a random walk of one billion particles. Instead of distributing particles to randomly chosen neighbors, it deterministically serves the neighbors in a fixed order. Black pixels denote cells that never get visited by a particle; for the other cells, the color of the pixel indicates in which direction the last particle went at the end of the process. More information can be found at

« All Submissions