On Spectral Properties of Signed Laplacians with Connections to Eventual Positivity
arXiv:2009.03581 · doi:10.1109/TAC.2020.3008300
Abstract
Signed graphs have appeared in a broad variety of applications, ranging from social networks to biological networks, from distributed control and computation to power systems. In this paper, we investigate spectral properties of signed Laplacians for undirected signed graphs. We find conditions on the negative weights under which a signed Laplacian is positive semidefinite via the Kron reduction and multiport network theory. For signed Laplacians that are indefinite, we characterize their inertias with the same framework. Furthermore, we build connections between signed Laplacians, generalized M-matrices, and eventually exponentially positive matrices.
arXiv commentonline publication in IEEE Transactions on Automatic Control
References in corpus (5)
- Spontaneous synchrony in power-grid networks
- Opinion Dynamics in Social Networks with Hostile Camps: Consensus vs. Polarization
- Structural balance and opinion separation in trust-mistrust social networks
- Network synchronization landscape reveals compensatory structures, quantization, and the positive effect of negative interactions
- On the Definiteness of the Weighted Laplacian and its Connection to Effective Resistance