Distributed Estimation of Graph Laplacian Eigenvalues by the Alternating Direction of Multipliers Method

This paper presents a new method for estimating the eigenvalues of the Laplacian matrix associated with the graph describing the network topology of a multi-agent system. Given an approximate value of the average of the initial condition of the network state and some intermediate values of the network state when performing a Laplacian-based average consensus, the estimation of the Laplacian eigenvalues is obtained by solving the factorization of the averaging matrix. For this purpose, in contrast to the state of the art, we formulate a convex optimization problem that is solved in a distributed way by means of the Alternating Direction Method of Multipliers (ADMM). The main variables in the optimization problem are the coefficients of a polynomial whose roots are precisely the inverse of the distinct nonzero Laplacian eigenvalues. The performance of the proposed method is evaluated by means of simulation results.

[1]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[2]  R. Merris.  Laplacian matrices of graphs: a survey , 1994 .

[3]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[4]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[5]  Siddhartha S. Srinivasa,et al.  Decentralized estimation and control of graph connectivity in mobile sensor networks , 2008, 2008 American Control Conference.

[6]  Richard M. Murray,et al.  Reply to "Comments on "Consensus and Cooperation in Networked Multi-Agent Systems"" , 2010, Proc. IEEE.

[7]  Antonio Bicchi,et al.  Observability and controllability verification in multi-agent systems through decentralized Laplacian spectrum estimation , 2010, 49th IEEE Conference on Decision and Control (CDC).

[8]  Asuman E. Ozdaglar,et al.  Constrained Consensus and Optimization in Multi-Agent Networks , 2008, IEEE Transactions on Automatic Control.

[9]  Alain Y. Kibangou.  Finite-time average consensus based protocol for distributed estimation over AWGN channels , 2011, IEEE Conference on Decision and Control and European Control Conference.

[10]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[11]  Emiliano Dall'Anese,et al.  Fast Consensus by the Alternating Direction Multipliers Method , 2011, IEEE Transactions on Signal Processing.

[12]  Euhanna Ghadimi,et al.  On the Optimal Step-size Selection for the Alternating Direction Method of Multipliers* , 2012 .

[13]  Martin J. Wainwright,et al.  Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling , 2010, IEEE Transactions on Automatic Control.

[14]  Alain Y. Kibangou,et al.  Graph Laplacian based matrix design for finite-time distributed average consensus , 2012, 2012 American Control Conference (ACC).

[15]  Christian Commault,et al.  Decentralized Laplacian Eigenvalues Estimation and Collaborative Network Topology Identification , 2012 .

[16]  Karl Henrik Johansson,et al.  Distributed algebraic connectivity estimation for adaptive event-triggered consensus , 2012, 2012 American Control Conference (ACC).

[17]  Andrzej Banaszuk,et al.  Hearing the clusters of a graph: A distributed algorithm , 2009, Autom..

[18]  Daniel Boley,et al.  Local Linear Convergence of ADMM on Quadratic or Linear Programs , 2012 .

[19]  Andrea Gasparri,et al.  Decentralized estimation of Laplacian eigenvalues in multi-agent systems , 2012, Autom..

[20]  Daniel Boley,et al.  Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs , 2013, SIAM J. Optim..

[21]  Alain Y. Kibangou,et al.  Consensus-based distributed estimation of Laplacian eigenvalues of undirected graphs , 2013, 2013 European Control Conference (ECC).

[22]  Henrik Sandberg,et al.  Optimal scaling of the ADMM algorithm for distributed quadratic programming , 2013, 52nd IEEE Conference on Decision and Control.

[23]  Alain Y. Kibangou,et al.  Step-size sequence design for finite-time average consensus in secure wireless sensor networks , 2014, Syst. Control. Lett..

[24]  U. Feige,et al.  Spectral Graph Theory , 2015 .