Distributed Estimation of Algebraic Connectivity.

Abstract

The measurement algebraic connectivity plays an important role in many graph theory-based investigations, such as cooperative control of multiagent systems. In general, the measurement is considered to be centralized. In this article, a distributed model is proposed to estimate the algebraic connectivity (i.e., the second smallest eigenvalue of the corresponding Laplacian matrix) by the approach of distributed estimation via high-pass consensus filters. The global asymptotic convergence of the proposed model is theoretically guaranteed. Numerical examples are shown to verify the theoretical results and the superiority of the proposed distributed model.