arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.03581eess.SYcs.SY
收藏

与最终正性有关的符号Laplacian的谱性质

On Spectral Properties of Signed Laplacians with Connections to Eventual Positivity

Wei Chen, Dan Wang, Ji Liu, Yongxin Chen, Sei Zhen Khong, Tamer Başar, Karl H. Johansson, Li Qiu

摘要:

符号图已经出现在各种各样的应用中,从社交网络到生物网络,从分布式控制和计算到电力系统。本文研究了无向符号图的符号拉普拉斯算子的谱性质。通过Kron约化和多端口网络理论,我们找到了符号拉普拉斯算子为半正定的负权条件。对于不确定的符号拉普拉斯算子,我们用同样的框架刻画了它们的惯性。此外,我们建立之间的连接签署拉普拉斯,广义M-矩阵,并最终指数正矩阵。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑