Cutoff for the Averaging process on the hypercube and complete bipartite graphs
Abstract
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 a discrete hypercube and when the graph is complete bipartite. Some general facts about the averaging process on arbitrary graphs are also discussed.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.