- Physical Review Journals
All JournalsPhysics Magazine

Physical Review Research

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Letter
  • Open Access

Assessing frustration in real-world signed networks: A statistical theory of balance

Anna Gallo1,2,*, Diego Garlaschelli1,2,3, and Tiziano Squartini1,4,2

  • *Contact author: anna.gallo@imtlucca.it
PDF

Phys. Rev. Research 6, L042065 – Published 19 December, 2024

DOI: https://doi.org/10.1103/PhysRevResearch.6.L042065

Abstract

According to the so-called strong version of structural balance theory, actors in signed social networks avoid establishing triads with an odd number of negative links. Generalizing, the weak version of balance theory allows for nodes to be partitioned into any number of blocks with positive internal links, mutually connected by negative links. If this prescription is interpreted rigidly, i.e., without allowing for statistical noise in the observed link signs, then most real graphs will appear to require a larger number of blocks than the actual one, or even to violate both versions of the theory. This might lead to conclusions invoking even more relaxed notions of balance. Here, after rephrasing structural balance theory in statistically testable terms, we propose an inference scheme to unambiguously assess whether a real-world signed graph is balanced. We find that the proposed statistical balance theory leads to interpretations that are quite different from those derived from the current deterministic versions of the theory.

View figure in article

Physics Subject Headings (PhySH)

Article Text

Supplemental Material

References (32)

  1. F. Heider, Attitudes and cognitive organization, J. Psychol. 21, 107 (1946).
  2. D. Cartwright and F. Harary, Structural balance: A generalization of Heider's theory, Psychol. Rev. 63, 277 (1956).
  3. F. Harary, M.-H. Lim, and D. C. Wunsch, Signed graphs for portfolio analysis in risk management, IMA J. Manag. Math. 13, 201 (2002).
  4. L. Ou-Yang, D.-Q. Dai, and X.-F. Zhang, Detecting protein complexes from signed protein-protein interaction networks, IEEE/ACM Trans. Comput. Biol. Bioinform. 12, 1333 (2015).
  5. F. Iorio, M. Bernardo-Faura, A. Gobbi, T. Cokelaer, G. Jurman, and J. Saez-Rodriguez, Efficient randomization of biological networks while preserving functional characterization of individual nodes, BMC Bioinf. 17, 542 (2016).
  6. H. Saiz, J. Gómez-Gardeñes, P. Nuche, A. Girón, Y. Pueyo, and C. L. Alados, Evidence of structural balance in spatial ecological networks, Ecography 40, 733 (2017).
  7. J. A. Davis, Clustering and structural balance in graphs, Hum. Relat. 20, 181 (1967).
  8. P. Doreian and A. Mrvar, A partitioning approach to structural balance, Soc. Netw. 18, 149 (1996).
  9. P. Anchuri and M. Magdon-Ismail, Communities and balance in signed networks: A spectral approach, in Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (IEEE Computer Society, Massachusetts, NW Washington, DC, USA, 2012), pp. 235–242.
  10. P. Doreian and A. Mrvar, Partitioning signed social networks, Soc. Netw. 31, 1 (2009).
  11. See Supplemental Material at http://link.aps.org/supplemental/10.1103/PhysRevResearch.6.L042065 for more details about the employed formalism, the derivation of the main results of the paper and additional exercises.
  12. F. Harary, On the measurement of structural balance, Behav. Sci. 4, 316 (1959).
  13. V. Traag, P. Doreian, and A. Mrvar, Partitioning signed networks, in Advances in Network Clustering and Blockmodeling (Wiley, Hoboken, NJ, 2019), Chap. 8, pp. 225–249.
  14. F. Harary, On the notion of balance of a signed graph, Mich. Math. J. 2, 143 (1953).
  15. T. Zasĺavsky, Balanced decompositions of a signed graph, J. Comb. Theory, Ser. B 43, 1 (1987).
  16. S. Aref and M. C. Wilson, Balance and frustration in signed networks, J. Complex Netw. 7, 163 (2019).
  17. M. Ruiz-García, J. Ozaita, M. Pereda, A. Alfonso, P. Brañas-Garza, J. A. Cuesta, and A. Sánchez, Triadic influence as a proxy for compatibility in social relationships, Proc. Natl. Acad. Sci. USA 120, e2215041120 (2023).
  18. P. Doreian and A. Mrvar, Structural balance and signed international relations, J. Soc. Struct. 16, 1 (2015).
  19. S. Aref, L. Dinh, R. Rezapour, and J. Diesner, Multilevel structural evaluation of signed directed social networks based on balance theory, Sci. Rep. 10, 15228 (2020).
  20. V. A. Traag and J. Bruggeman, Community detection in networks with positive and negative links, Phys. Rev. E 80, 036115 (2009).
  21. B. Yang, X. Zhao, and X. Liu, Bayesian approach to modeling and detecting communities in signed network, in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI Press, Washington, DC, 2015).
  22. J. Q. Jiang, Stochastic block model and exploratory analysis in signed networks, Phys. Rev. E 91, 062805 (2015).
  23. B. Yang, X. Liu, Y. Li, and X. Zhao, Stochastic blockmodeling and variational Bayes learning for signed network analysis, IEEE Trans. Knowl. Data Eng. 29, 2026 (2017).
  24. A. E. Raftery, Bayesian model selection in social research, Sociol. Methodol. 25, 111 (1995).
  25. S. Konishi and G. Kitagawa, Information Criteria and Statistical Modeling (Springer, Berlin, 2008).
  26. S. Gómez, P. Jensen, and A. Arenas, Analysis of community structure in networks of correlated data, Phys. Rev. E 80, 016114 (2009).
  27. A. Amelio and C. Pizzuti, Community mining in signed networks: A multiobjective approach, in Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (Association for Computing Machinery, New York, 2013), pp. 95–99.
  28. P. Esmailian and M. Jalili, Community detection in signed networks: The role of negative ties in different scales, Sci. Rep. 5, 14339 (2015).
  29. Y. Su, B. Wang, F. Cheng, L. Zhang, X. Zhang, and L. Pan, An algorithm based on positive and negative links for community detection in signed networks, Sci. Rep. 7, 10874 (2017).
  30. A. Gallo, D. Garlaschelli, R. Lambiotte, F. Saracco, and T. Squartini, Testing structural balance theories in heterogeneous signed networks, Commun. Phys. 7, 154 (2024).
  31. B. Hao and I. A. Kovács, Proper network randomization is key to assessing social balance, Sci. Adv. 10, eadj0104 (2024).
  32. A. Gallo, F. Saracco, R. Lambiotte, D. Garlaschelli, and T. Squartini, Patterns of link reciprocity in directed, signed networks, arXiv:2407.08697.

Outline

Information

Phys. Rev. Research 6, L042065– Published 19 December, 2024
  • Received 24 April 2024
  • Accepted 8 November 2024
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation