Summary
International Symposium on Nonlinear Theory and Its Applications
2015
Session Number:A4L-D
Session:
Number:A4L-D-1
Proposal of a Truly Decentralized Algorithm for Estimating Algebraic Connectivity of Multi-Agent Networks
Kazuma Yamane, Norikazu Takahashi,
pp.277-280
Publication Date:2015/12/1
Online ISSN:2188-5079
Summary:
Algebraic connectivity, the second smallest eigenvalue of the Laplacian matrix, of a network is an important quantity that represents how well the network is connected. In this paper, we propose a novel method for each agent in a network to estimate the algebraic connectivity of the network. The proposed method is truly decentralized because each agent updates the state value by using the information obtained from only agents in the neighborhood. The validity of the proposed method is confirmed by theoretical analysis and numerical experiments.