Computing global structural balance in large-scale signed social networks
Computing global structural balance in large-scale signed social networks
复制标题
DOI：
10.1073/pnas.1109521108
复制
发表时间：
2011-12-27
影响因子：
11.1
通讯作者：
Altafini, Claudio
中科院分区：
文献类型：
--
作者：
Facchetti, Giuseppe;Iacono, Giovanni;Altafini, Claudio
结构平衡理论认为，符号社会网络(即符号边代表个体之间友好/敌对互动的图)往往是为了避免冲突情况而组织的，对应于负对等的循环。本文利用大规模伊辛自旋眼镜中的基态计算算法，计算了超大型在线社交网络的全局平衡水平，并验证了目前可用的网络确实是极端平衡的。这一性质可以用图的节点上符号分布的高度偏斜度来解释。尤其是，被大多数负面因素联系在一起的人大多会造成“明显的混乱”，而不是真正的“挫败感”。
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."