  In this article, we establish exponential contraction results for the
diameter and variance of general first-order multiagent systems. Our approach
is based on compactification techniques, and works under rather mild
assumptions. Namely, we posit that either the scrambling coefficient, or the
algebraic connectivity of the averaged interaction graphs of the system over
all time windows of a given length are uniformly positive.
