On the Definiteness of the Weighted Laplacian and its Connection to Effective Resistance

Abstract

This work explores the definiteness of the weighted graph Laplacian matrix with negative edge weights. The definiteness of the weighted Laplacian is studied in terms of certain matrices that are related via congruent and similarity transformations. For a graph with a single negative weight edge, we show that the weighted Laplacian becomes indefinite if the magnitude of the negative weight is less than the inverse of the effective resistance between the two incident nodes. This result is extended to multiple negative weight edges. The utility of these results are demonstrated in a weighted consensus network where appropriately placed negative weight edges can induce a clustering behavior for the protocol.

arXiv commentSubmitted to the IEEE Conference on Decision and Control (IEEE CDC)

References in corpus (2)

• The structure and function of complex networks
• Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local Feedback

Cited by in corpus (6)

• On Extension of Effective Resistance with Application to Graph Laplacian Definiteness and Power Network Stability
• Rotor-angle versus voltage instability in the third-order model for synchronous generators
• On Spectral Properties of Signed Laplacians with Connections to Eventual Positivity
• On fast-slow consensus networks with a dynamic weight
• Multi-agent consensus over time-invariant and time-varying signed digraphs via eventual positivity
• Probabilistic stabilizability certificates for a class of black-box linear systems