A new decentralized discrete-time algorithm for estimating algebraic connectivity of multiagent networks
Endo Kento, Norikazu Takahashi · 2016
Algebraic connectivity of a network, which is defined as the second smallest eigenvalue of the Laplacian matrix, represents how strongly the network is connected. This paper proposes a new decentralized discrete-time algorithm for the estimation of the algebraic connectivity of multiagent networks. The validity of the proposed algorithm is verified by theoretical analysis and numerical experiments.