Beta Current Flow Centrality for Weighted Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

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.
Fichier principal
Vignette du fichier
CSoNet2015_Paper83.pdf (306.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01258658 , version 1 (19-01-2016)



Konstantin Avrachenkov, Vladimir Mazalov, Bulat Tsynguev. Beta Current Flow Centrality for Weighted Networks. 4th International Conference on Computational Social Networks (CSoNet 2015), Aug 2015, Beijing, China. pp.216-227, ⟨10.1007/978-3-319-21786-4_19⟩. ⟨hal-01258658⟩


276 View
362 Download



Gmail Facebook Twitter LinkedIn More