Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Code available at github.com/egalimberti/balance_visualization.
- 2.
Dataset available at konect.cc.
References
Akiyama, J., Avis, D., Chvátal, V., Era, H.: Balancing signed graphs. Discrete Appl. Math. 3(4), 227–233 (1981)
Aref, S., Mason, A.J., Wilson, M.C.: Computing the line index of balance using integer programming optimisation. In: Goldengorin, B. (ed.) Optimization Problems in Graph Theory, pp. 65–84. Springer, Cham (2018)
Aref, S., Wilson, M.C.: Measuring partial balance in signed networks. J. Complex Netw. 6(4), 566–595 (2017)
Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1–3), 89–113 (2004)
Bonchi, F., Galimberti, E., Gionis, A., Ordozgoiti, B., Ruffo, G.: Discovering polarized communities in signed networks. In: Proceedings of the 2019 ACM on Conference on Information and Knowledge Management. ACM (2019)
Cartwright, D., Harary, F.: Structural balance: a generalization of heider’s theory. Psychol. Rev. 63(5), 277 (1956)
Coleman, T., Saunderson, J., Wirth, A.: A local-search 2-approximation for 2-correlation-clustering. In: European Symposium on Algorithms, pp. 308–319 (2008)
Coleman, T., Saunderson, J., Wirth, A.: Spectral clustering with inconsistent advice. In: Proceedings of the 25th International Conference on Machine Learning, pp. 152–159. ACM (2008)
Doreian, P., Mrvar, A.: Structural balance and signed international relations. J. Soc. Struct. 16, 1 (2015)
Easley, D., Kleinberg, J.: Positive and negative relationships. In: Networks, Crowds, and Markets: Reasoning about a Highly Connected World, Cambridge University Press (2010)
Harary, F.: On the notion of balance of a signed graph. Mich. Math. J. 2(2), 143–146 (1953)
Harary, F., Kabell, J.A.: A simple algorithm to detect balance in signed graphs. Math. Soc. Sci. 1(1), 131–136 (1980)
Hou, Y.P.: Bounds for the least Laplacian eigenvalue of a signed graph. Acta Mathematica Sinica 21(4), 955–960 (2005)
Hou, Y., Li, J., Pan, Y.: On the Laplacian eigenvalues of signed graphs. Linear and Multilinear Algebra 51(1), 21–30 (2003)
Kaufmann, M., Wagner, D.: Drawing graphs: methods and models, vol. 2025. Springer (2003)
Krzywinski, M., Birol, I., Jones, S.J.M., Marra, M.A.: Hive plots—rational approach to visualizing networks. Briefings in Bioinform. 13(5), 627–644 (2011)
Kunegis, J., Schmidt, S., Lommatzsch, A., Lerner, J., De Luca, E.W., Albayrak, S.: Spectral analysis of signed graphs for clustering, prediction and visualization. In: Proceedings of the 2010 SIAM International Conference on Data Mining, pp. 559–570. SIAM (2010)
Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 1361–1370. ACM (2010)
Ordozgoiti, B., Gionis, A.: Reconciliation k-median: clustering with non-polarized representatives. In: The World Wide Web Conference, pp. 1387–1397. ACM (2019)
Redner, S.: Social balance on networks: the dynamics of friendship and hatred. In: APS Meeting Abstracts (2006)
Tang, J., Chang, Y., Aggarwal, C., Liu, H.: A survey of signed network mining in social media. ACM Comput. Surv. (CSUR) 49(3), 42 (2016)
Xia, W., Cao, M., Johansson, K.H.: Structural balance and opinion separation in trust-mistrust social networks. IEEE Trans. Control Netw. Syst. 3(1), 46–56 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Galimberti, E., Madeddu, C., Bonchi, F., Ruffo, G. (2020). Visualizing Structural Balance in Signed Networks. In: Cherifi, H., Gaito, S., Mendes, J., Moro, E., Rocha, L. (eds) Complex Networks and Their Applications VIII. COMPLEX NETWORKS 2019. Studies in Computational Intelligence, vol 882. Springer, Cham. https://doi.org/10.1007/978-3-030-36683-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-36683-4_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-36682-7
Online ISBN: 978-3-030-36683-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)