More on Spectral Analysis of Signed Networks

Guihai Yu and Hui Qu

Complexity, 2018, vol. 2018, 1-6

Abstract:

Spectral graph theory plays a key role in analyzing the structure of social (signed) networks. In this paper we continue to study some properties of (normalized) Laplacian matrix of signed networks. Sufficient and necessary conditions for the singularity of Laplacian matrix are given. We determine the correspondence between the balance of signed network and the singularity of its Laplacian matrix. An expression of the determinant of Laplacian matrix is present. The symmetry about of eigenvalues of normalized Laplacian matrix is discussed. We determine that the integer is an eigenvalue of normalized Laplacian matrix if and only if the signed network is balanced and bipartite. Finally an expression of the coefficient of normalized Laplacian characteristic polynomial is present.

Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2018/3467158.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2018/3467158.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:3467158

DOI: 10.1155/2018/3467158

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().