Math Trek Math

Scheduling Random Walks

By Ivars Peterson

- More than 2 years ago

Juggling competing demands in a network of feverishly calculating computers drawing on the same memory resources is like trying to avert collisions among blindfolded, randomly zigzagging ice skaters.

Example of a graph with one token poised to take a random walk.

In this example of dependent percolation, a fickle demon would win (so far), but a clairvoyant demon would be blocked.