Ranking of nodes in the mathematical portal Math-Net.ru publications graph

Abstract

We propose a new method for determining betweenness centraity for weighted graphs based on Kirchhoff's law. This method has low computational complexity. The results of numerical experiments are presented for the coauthors graph from the math portal Math-Net.ru. A comparison is drawn with the PageRank method

Keywords

• betweenness centrality
• weighted graph
• social networks analysis