arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2210.01858cs.SI
收藏

以偏好序为节点属性的网络结构平衡考虑

Structural Balance Considerations for Networks with Preference Orders as Node Attributes

Olle Abrahamsson, Danyo Danev, Erik G. Larsson

摘要:

我们讨论了可能的定义的结构平衡条件的网络与偏好排序的节点属性。主要结果是,对于有三个替代品($A,B,C$)的情况下,我们减少了$(3!)^3 = 216$可能的配置三角形的$10$等价类,并使用这些措施的平衡的三角形对可能的扩展结构平衡理论。此外,我们推导出一个一般公式的数量等价类的偏好$n$替代品。最后,我们分析了一个真实世界的数据集,并比较其经验分布的三角等价类的一个零假设,其中偏好随机分配给节点。

英文摘要:

We discuss possible definitions of structural balance conditions in a network with preference orderings as node attributes. The main result is that for the case with three alternatives ($A,B,C$) we reduce the $(3!)^3 = 216$ possible configurations of triangles to $10$ equivalence classes, and use these as measures of balance of a triangle towards possible extensions of structural balance theory. Moreover, we derive a general formula for the number of equivalent classes for preferences on $n$ alternatives. Finally, we analyze a real-world data set and compare its empirical distribution of triangle equivalence classes to a null hypothesis in which preferences are randomly assigned to the nodes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑