Journal
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA
Volume 108, Issue 52, Pages 20953-20958Publisher
NATL ACAD SCIENCES
DOI: 10.1073/pnas.1109521108
Keywords
combinatorial optimization; social network theory
Categories
Funding
- Ministero dell'Istruzione, dell'Universita' e della Ricerca
- EU [246698]
Ask authors/readers for more resources
Structural balance theory affirms that signed social networks (i.e., graphs whose signed edges represent friendly/hostile interactions among individuals) tend to be organized so as to avoid conflictual situations, corresponding to cycles of negative parity. Using an algorithm for ground-state calculation in large-scale Ising spin glasses, in this paper we compute the global level of balance of very large online social networks and verify that currently available networks are indeed extremely balanced. This property is explainable in terms of the high degree of skewness of the sign distributions on the nodes of the graph. In particular, individuals linked by a large majority of negative edges create mostly apparent disorder, rather than true frustration.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available