Visualizing Structural Balance in Signed Networks

Network visualization has established as a key complement to network analysis since the large variety of existing network layouts are able to graphically highlight different properties of networks. However, signed networks, i.e., networks whose edges are labeled as friendly (positive) or antagonistic (negative), are target of few of such layouts and none, to our knowledge, is able to show structural balance, i.e., the tendency of cycles towards including an even number of negative edges, which is a well-known theory for studying friction and polarization. In this work we present Structural-balance-viz: a novel visualization method showing whether a connected signed network is balanced or not and, in the latter case, how close the network is to be balanced. Structural-balance-viz exploits spectral computations of the signed Laplacian matrix to place network's nodes in a Cartesian coordinate system resembling a balance (a scale). Moreover, it uses edge coloring and bundling to distinguish positive and negative interactions. The proposed visualization method has characteristics desirable in a variety of network analysis tasks: Structural-balance-viz is able to provide indications of balance/polarization of the whole network and of each node, to identify two factions of nodes on the basis of their polarization, and to show their cumulative characteristics. Moreover, the layout is reproducible and easy to compare. Structural-balance-viz is validated over synthetic-generated networks and applied to a real-world dataset about political debates confirming that it is able to provide meaningful interpretations.

[1]  F. Harary.  On the notion of balance of a signed graph. , 1953 .

[2]  James Saunderson,et al.  A Local-Search 2-Approximation for 2-Correlation-Clustering , 2008, ESA.

[3]  Sahin Albayrak,et al.  Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization , 2010, SDM.

[4]  Jon M. Kleinberg,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World [Book Review] , 2013, IEEE Technol. Soc. Mag..

[5]  James Saunderson,et al.  Spectral clustering with inconsistent advice , 2008, ICML '08.

[6]  Aristides Gionis,et al.  Discovering Polarized Communities in Signed Networks , 2019, CIKM.

[7]  Mark C. Wilson,et al.  Measuring Partial Balance in Signed Networks , 2015, J. Complex Networks.

[8]  Anthony Wirth,et al.  Correlation Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[9]  Mark C. Wilson,et al.  Computing the Line Index of Balance Using Integer Programming Optimisation , 2017, ArXiv.

[10]  Inanç Birol,et al.  Hive plots - rational approach to visualizing networks , 2012, Briefings Bioinform..

[11]  Yaoping Hou,et al.  On the Laplacian Eigenvalues of Signed Graphs , 2003 .

[12]  Sidney Redner.  Social Balance on Networks: The Dynamics of Friendship and Hatred , 2006 .

[13]  F. Harary,et al.  STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .

[14]  Michael Kaufmann,et al.  Drawing graphs: methods and models , 2001 .

[15]  Yaoping Hou.  Bounds for the Least Laplacian Eigenvalue of a Signed Graph , 2005 .

[16]  Aristides Gionis,et al.  Reconciliation k-median: Clustering with Non-polarized Representatives , 2019, WWW.

[17]  Frank Harary,et al.  A simple algorithm to detect balance in signed graphs , 1980, Math. Soc. Sci..

[18]  David Avis,et al.  Balancing signed graphs , 1981, Discret. Appl. Math..

[19]  Patrick Doreian,et al.  Structural Balance and Signed International Relations , 2015, J. Soc. Struct..

[20]  Jure Leskovec,et al.  Signed networks in social media , 2010, CHI.

[21]  Charu C. Aggarwal,et al.  A Survey of Signed Network Mining in Social Media , 2015, ACM Comput. Surv..

[22]  Karl Henrik Johansson,et al.  Structural Balance and Opinion Separation in Trust–Mistrust Social Networks , 2016, IEEE Transactions on Control of Network Systems.