Araguesa, Rosario; Shi, Guodong; Dimarogonas, Dimos V; Sagüés, Carlos; Johansson , Karl Henrik; Mezouara, Youcef
The algebraic connectivity of the graph Laplacian plays an essential role in various multi-agent control systems. In many cases a lower bound of this algebraic connectivity is necessary in order to achieve a certain performance. Lately, several methods based on distributed Power Iteration have been proposed for computing the algebraic connectivity of a symmetric Laplacian matrix. However, these methods cannot give any lower bound of the algebraic connectivity and their convergence rates are...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.