On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian

We consider the set G consisting of graphs of fixed order and weighted edges. The vertex set of graphs in G will correspond to point masses and the weight for an edge between two vertices is a functional of the distance between them. We pose the problem of finding the best vertex positional configuration in the presence of an additional proximity constraint, in the sense that, the second smallest eigenvalue of the corresponding graph Laplacian is maximized. In many recent applications of algebraic graph theory in systems and control, the second smallest eigenvalue of Laplacian has emerged as a critical parameter that influences the stability and robustness properties of dynamic systems that operate over an information network. Our motivation in the present work is to "assign" this Laplacian eigenvalue when relative positions of various elements dictate the interconnection of the underlying weighted graph. In this venue, one would then be able to "synthesize" information graphs that have desirable system theoretic properties.

[1]  Abraham Berman,et al.  Lower bounds for the eigenvalues of Laplacian matrices , 2000 .

[2]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[3]  J. Gower Properties of Euclidean and non-Euclidean distance matrices , 1985 .

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

[5]  George J. Pappas,et al.  Flocking in Fixed and Switching Networks , 2007, IEEE Transactions on Automatic Control.

[6]  M. Fiedler A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[7]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[8]  中嶋 博 Convex Programming の新しい方法 (開学記念号) , 1966 .

[9]  Ding-Zhu Du,et al.  Notes on the Complexity of Switching Networks , 2001 .

[10]  Stephen Guattery,et al.  On the Quality of Spectral Separators , 1998, SIAM J. Matrix Anal. Appl..

[11]  Shaun M. Fallat,et al.  Extremizing algebraic connectivity subject to graph theoretic constraints , 1998 .

[12]  Mehran Mesbahi,et al.  Quadratically constrained attitude control via semidefinite programming , 2004, IEEE Transactions on Automatic Control.

[13]  Kaveh Pahlavan,et al.  Wireless Information Networks , 1995 .

[14]  F. Chung,et al.  Weighted graph Laplacians and isoperimetric inequalities , 2000 .

[15]  Richard M. Murray,et al.  Information flow and cooperative control of vehicle formations , 2004, IEEE Transactions on Automatic Control.

[16]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[17]  Mehran Mesbahi,et al.  On state-dependent dynamic graphs and their controllability properties , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

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