Early consensus in complex networks under variable graph topology

Analysis of the linear algorithm for consensus on complex networks shows the existence of two distinct phases, the asymptotic and the transient. The network reaches the asymptotic when the components corresponding to the spectral gap eigenvalue of the weighted graph laplacian become dominating. However, in cases of changing graph topology the transit to asymptotic convergence is slow. Therefore, the entire spectrum affects the rate of convergence. Hence, we propose an adaptive nonlinear algorithm for consensus that allows for better performance during the transient phase.

Published in:
Proceedings of the European Conference on Circuit Theory and Design 2009, 575-578
Presented at:
European conference on circuit theory and design 2009 (ECCTD 2009), Antalya, Turkey, Aug. 23-27, 2009
Piscataway NJ, IEEE

Note: The status of this file is: EPFL only

 Record created 2009-09-03, last modified 2018-03-17

Publisher's version:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
(Not yet reviewed)