Structural balance in fully signed networks. (23rd February 2016)

• Record Type: Journal Article
• Authors: Du, Haifeng; He, Xiaochen; Feldman, Marcus W.
• Is Part Of: Complexity. Volume 21(2016)Supplement 1
• Page Start: 497
• Page End: 511
• Publication Date: 2016-02-23
• Subjects: structural balance -- node attribute -- signed network -- optimization algorithm; Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1002/cplx.21764
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : Node attributes play an important role in shaping network structures, but are generally ignored in transformations of structural balance. A fully signed network consisting of signs of edges and nodes expresses both properties of relationship and node attributes. In this article, we generalize the definition of structural balance in fully signed networks. We transform the unbalanced fully signed network by not only changing signs of edges but also changing the signs of nodes. We propose a memetic algorithm to transform unbalanced networks at the lowest cost. Experiments show that our algorithm can solve this problem efficiently, and different node attribute assignments may lead to different optimized structures. © 2016 Wiley Periodicals, Inc. Complexity 21: 497–511, 2016