Game-theoretic centrality in the graph nodes based upon the Shapley vector.
Toropov Boris Andreevich
PhD in Technical Science
Associate Professor at the IT Department of the Academy of Management of the Ministry of Internal Affairs of the Russian Federation
125171, Russia, Moscow, ul. Z.i A. Kosmodem'yanskikh, 8
Abstract. The object of studies concerns the methods for evaluation of the graph nodes. The author pays attention to the fact that the existing centrality metrics, such as level centrality, closeness centrality, interval centrality, own vector, etc., are sometimes not suitable for modeling the situations, when graph nodes are social object models, and therefore, they are capable of cooperation in order to achieve social goals. In this case game-theoretic centrality models (such as coalition games models) are better suited to reflect the modeling object. The methodology of the study involves the elements of graph theory, probability theory, as well as the apparatus for the analysis of social networks as a new independent scientific sphere. The key result of the stuy is that game-theoretic centrality based upon the Shapley vector is a flexible and mostly universal instrument for the social graph analysis. It allows to consider an unlimited set of quality characteristics of the graph nodes, as well as their topological qualities in any combination in order to evaluate the nodes.
algorithm, permutation, Shapley vector, coalition games, group centrality, level centrality, node centrality, social network, social graph, graph
Article was received: 26-04-2017
This article written in Russian. You can find full text of article in Russian here.