Spectral Graph Theory and Network Dependability

The paper introduces methods of graph theory for ranking substations of an electric power grid. In particular, spectral graph theory is used and several ranking algorithms are described. The procedure is illustrated on a practical numerical example

[1]  F. Chung.  Four proofs for the Cheeger inequality and graph partition algorithms , 2007 .

[2]  Daniel A. Spielman,et al.  Spectral Graph Theory and its Applications , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[3]  A. Ostrowski.  A QUANTITATIVE FORMULATION OF SYLVESTER'S LAW OF INERTIA. , 1959, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Stefan Burr,et al.  The Mathematics of networks , 1982 .

[5]  Leslie Hogben,et al.  SPECTRAL GRAPH THEORY AND THE INVERSE EIGENVALUE PROBLEM OF A GRAPH , 2005 .

[6]  Seth Blumsack,et al.  A Centrality Measure for Electrical Networks , 2008, Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008).

[7]  B.F. Wollenberg,et al.  Toward a smart grid: power delivery for the 21st century , 2005, IEEE Power and Energy Magazine.

[8]  Massoud Amin,et al.  Toward self-healing infrastructure systems , 2000, Computer.

[9]  Carl E. Landwehr,et al.  Basic concepts and taxonomy of dependable and secure computing , 2004, IEEE Transactions on Dependable and Secure Computing.

[10]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.