We analyze the L1-mixing of a generalization of the averaging process introduced by Aldous (2011). The process takes place on a growing sequence of graphs which we assume to be finite-dimensional, in the sense that the random walk on those geometries satisfies a family of Nash inequalities. As a byproduct of our analysis, we provide a complete picture of the total variation mixing of a discrete dual of the averaging process, which we call binomial splitting process. A single particle of this process is essentially the random walk on the underlying graph. When several particles evolve together, they interact by synchronizing their jumps when placed on neighboring sites. We show that, given k the number of particles and n the (growing) size of the underlying graph, the system exhibits cutoff in total variation if k→∞ and k=O(n2). Finally, we exploit the duality between the two processes to show that the binomial splitting process satisfies a version of Aldous’ spectral gap identity, namely, the relaxation time of the process is independent of the number of particles.
