Cutoff for the averaging process on the hypercube and complete bipartite graphs
Cutoff for the averaging process on the hypercube and complete bipartite graphs
We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes. We establish cutoff phenomena for both the L1 and L2 distance from stationarity when the graph is …