Scalability and Fragility in Bounded-Degree Consensus Networks
We investigate the performance of linear consensus algorithms subject to a scaling of the underlying network size. Specifically, we model networked systems with nth order integrator dynamics over families of undirected, weighted graphs with bounded nodal degrees. In such networks, the algebraic connectivity affects convergence rates, sensitivity, and, for high-order consensus [n ≥ 3), stability pr
