Computing global structural balance in large-scale signed social networks.

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 on-line 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''