Skip to Main content Skip to Navigation
Conference papers

Beta Current Flow Centrality for Weighted Networks

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01258658
Contributor : Konstantin Avrachenkov <>
Submitted on : Tuesday, January 19, 2016 - 12:37:57 PM
Last modification on : Thursday, September 24, 2020 - 10:22:03 AM
Long-term archiving on: : Wednesday, April 20, 2016 - 12:20:28 PM

File

CSoNet2015_Paper83.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

583

Files downloads

611