On Convergence Rate of Weighted-Averaging Dynamics for Consensus Problems.

This paper investigates the weighted-averaging dynamic for unconstrained and constrained consensus problems. Through the use of a suitably defined adjoint dynamic, quadratic Lyapunov comparison functions are constructed to analyze the behavior of weighted-averaging dynamic. As a result, new convergence rate results are obtained that capture the graph structure in a novel way. In particular, the exponential convergence rate is established for unconstrained consensus with the exponent of the order of $1-O(1/(m\log_{2}m))$ for special tree-like regular graphs. Also, the exponential convergence rate is established for constrained consensus over time-varying graphs, which nontrivially extends the existing result limited to the static graph case and the use of uniform weight matrices. Our main results are developed for directed graphs that are weakly connected, and we also provide statements regarding the rates in case of joint connectivity.