A group of simulated agents each begin with their own noisy estimate of a single number. No agent can see all the estimates, and each one can only exchange values with its nearest neighbours.

The Graph Laplacian consensus algorithm has every agent repeatedly average its value with those of its neighbours. After enough rounds, all the agents converge on the same number.