Verification and prediction of structural balance: A data-driven perspective

The structural balance plays a fundamental role in networked systems with both attractive and repulsive interactions, which can be characterized by a signed network. In this paper, we show that the ensemble of type of interaction in a signed network can be inferred from the eigenvector of the signed...

Full description

Saved in:
Bibliographic Details
Published in2016 American Control Conference (ACC) pp. 2858 - 2863
Main Authors Lulu Pan, Haibin Shao, Mesbahi, Mehran
Format Conference Proceeding Journal Article
LanguageEnglish
Published American Automatic Control Council (AACC) 01.07.2016
Subjects
Aerodynamics
Cartesian
Conferences
Context
Decomposition
Dynamics
Eigenvalues and eigenfunctions
Eigenvectors
Electronics
Graphs
Joining processes
Laplace equations
Networks
Protocols
Social network services
Online AccessGet full text

Cover

More Information
Summary:The structural balance plays a fundamental role in networked systems with both attractive and repulsive interactions, which can be characterized by a signed network. In this paper, we show that the ensemble of type of interaction in a signed network can be inferred from the eigenvector of the signed Laplacian matrix. Also, it has been shown that a graph, derived from the graph Cartesian product of factor graphs, is structurally balanced if and only if its factors are structurally balanced. According to the theoretical results, the verification and prediction of the structural balance of the signed network is presented from a data-driven perspective by utilizing the dynamic mode decomposition.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:2378-5861
DOI:10.1109/ACC.2016.7525352