当前位置: X-MOL 学术Autom. Remote Control › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Modified Myerson Value for Determining the Centrality of Graph Vertices
Automation and Remote Control ( IF 0.7 ) Pub Date : 2021-02-25 , DOI: 10.1134/s0005117921010100
V. V. Mazalov , V. A. Khitraya

Abstract

To analyze the structure of social networks, the methods of cooperative game theory can be adopted. One of such methods is based on the calculation of the Myerson values as a centrality measure of the vertices in a graph. In this case, the number of paths of a certain length in the subgraphs corresponding to the coalitions is used as the characteristic function. This paper proposes a modification of the Myerson value for the case where the paths in a graph containing cycles are included in consideration. The effectiveness of this approach is illustrated by several examples.



中文翻译:

确定图顶点中心性的修正Myerson值

摘要

为了分析社交网络的结构,可以采用合作博弈的方法。其中一种方法是基于对Myerson值的计算,将其作为图形中顶点的中心度。在这种情况下,将与联盟对应的子图中一定长度的路径数用作特征函数。本文考虑了包含循环的图形中的路径时,建议对Myerson值进行修改。几个示例说明了这种方法的有效性。

更新日期:2021-02-25
down
wechat
bug