V.V. Mazalov, K.E. Avrachenkov, L.I. Trukhina, B.T. Tsynguev.
Game-Theoretic Centrality Measures for Weighted Graphs
// Fundamenta Informaticae. Vol. 145, iss. 3. 2016. Pp. 341-358
Ключевые слова: betweenness centrality, weighted graph, cooperative game, social networks
The betweenness centrality is one of the basic concepts in the analysis of the social networks. Initial definition for the betweenness of a node in the graph is based on the fraction of the number of geodesics (shortest paths) between any two nodes that given node lies on, to the total number of the shortest paths connecting these nodes. This method has polynomial complexity. We propose a new concept of the betweenness centrality for weighted graphs using the methods of cooperative game theory. The characteristic function is determined by special way for different coalitions (subsets of the graph). Two approaches are used to determine the characteristic function. In the first approach the characteristic function is determined via the number of direct and indirect weighted connecting paths in the coalition. In the second approach the coalition is considered as an electric network and the characteristic function is determined as a total current in this network. We use the Kirchhoff’s law. After that the betweenness centrality is determined as the Myerson value. The results of computer simulations for some examples of networks, in particular, for the popular social network “VKontakte”, as well as the comparing with the PageRank method are presented.
Индексируется в Web of Science
Последние изменения: 1 февраля 2017