带号有向图的结构平衡性：考虑传递性度量不同链签名方法构造的图的平衡性
Structural balance in signed digraphs: considering transitivity to measure balance in graphs constructed by using different link signing methods
摘要：
结构平衡理论假设网络中的三元组倾向于稳定的构型。该理论在无向图中得到了验证。由于现实世界的网络往往是有向的，我们介绍了一种新的方法，同时考虑传递性和符号一致性计算平衡的有向图。我们使用不同的方法来识别边缘符号：自然语言处理从底层文本数据中推断符号，以及自我报告的调查数据。我们的研究结果表明，对于各种社会背景和边缘符号检测方法，平衡度较高，范围从67.5%到92.4%。
英文摘要：
Structural balance theory assumes triads in networks to gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for considering both transitivity and sign consistency for calculating balance in signed digraphs. We test our approach on graphs that we constructed by using different methods for identifying edge signs: natural language processing to infer signs from underlying text data, and self-reported survey data. Our results show that for various social contexts and edge sign detection methods, balance is moderately high, ranging from 67.5% to 92.4%.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
