Applications of Structural Balance in Signed Social Networks

Abstract

We present measures, models and link prediction algorithms based on the structural balance in signed social networks. Certain social networks contain, in addition to the usual 'friend' links, 'enemy' links. These networks are called signed social networks. A classical and major concept for signed social networks is that of structural balance, i.e., the tendency of triangles to be 'balanced' towards including an even number of negative edges, such as friend-friend-friend and friend-enemy-enemy triangles. In this article, we introduce several new signed network analysis methods that exploit structural balance for measuring partial balance, for finding communities of people based on balance, for drawing signed social networks, and for solving the problem of link prediction. Notably, the introduced methods are based on the signed graph Laplacian and on the concept of signed resistance distances. We evaluate our methods on a collection of four signed social network datasets.

37 pages

References in corpus (2)

• Recommender System for Online Dating Service
• A Model of Weighted Network: the Student Relationships in a Class

Cited by in corpus (6)

• Exploiting the Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications
• Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
• A Survey of Signed Network Mining in Social Media
• Evaluating balance on social networks from their simple cycles
• Eigenvalues of weakly balanced signed graphs and graphs with negative cliques
• A modelling and computational study of the frustration index in signed networks