Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
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]
|Collections||ANU Research Publications|
|01_Araguesa_Distributed_algebraic_2014.pdf||666.55 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.