One walker, dropped somewhere in the network. Every step it
picks one of its current node's neighbours at random and moves there. It has no
plan and no memory. Let it run and count how often it visits each node.
Walk moves the walker one step at a time, slowly enough to
follow. Run 5,000 steps skips ahead.
Nodes darken with the share of visits they have collected.
The orange tick above each bar is k / 2m: that node's own number
of edges, divided by twice the number of edges in the network. Watch the
bars find it.