Beta Current Flow Centrality for Weighted Networks
Betweenness centrality is one of the basic concepts in the analysis of social networks. Initial definition for the betweenness of a node in a 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 quadratic complexity and does not take into account indirect paths. We propose a new concept of betweenness centrality for weighted network, beta current flow centrality, based on Kirchhoff’s law for electric circuits. In comparison with the original current flow centrality and alpha current flow centrality, this new measure can be computed for larger networks. The results of numerical experiments for some examples of networks, in particular, for the popular social network VKontakte as well as the comparison with PageRank method are presented.
KeywordsBeta current flow centrality Betweenness centrality Pagerank Weighted graph Social networks
Unable to display preview. Download preview PDF.
- 1.Aumann, R., Myerson, R.: Endogenous formation of links between players and coalitions: an application of the Shapley value. In: The Shapley value, pp. 175–191. Cambridge University Press (1988)Google Scholar
- 4.Avrachenkov, K.E., Filar J.A., Howlett, P.G.: Analytic Perturbation Theory and its Applications. SIAM (2013)Google Scholar
- 5.Borgatti, S.P., Everett, M.G., Freeman, L.C.: Ucinet for Windows: Software for Social Network Analysis. Harvard (2002)Google Scholar
- 7.Borm, P., van den Nouweland, A., Tijs, S.: Cooperation and communication restrictions: a survey. In: Imperfections and Behavior in Economic Organizations. Kluwer (1994)Google Scholar
- 14.Jackson, M.O.: Social and economic networks. Princeton University Press (2008)Google Scholar
- 16.Mazalov, V.: Mathematical Game Theory and Applications. Wiley (2014)Google Scholar