Discussion Papers, Department of Business and Management Science, Norwegian School of Economics (NHH)
Centrality Computation in Weighted Networks Based on Edge-Splitting Procedure
() and Kurt Jörnsten
Abstract: The analysis of network’s centralities has a high-level
significance for many real-world applications. The variety of game and
graph theoretical approaches has a paramount purpose to formalize a
relative importance of nodes in networks. In this paper we represent an
algorithm for the centrality calculation in the domain of weighted
networks. The given algorithm calculates network centralities for weighted
graphs based on the proposed procedure of edges’ splitting. The approach is
tested and illustrated based on different types of network topologies.
Keywords: Network centrality; weighted graphs; edge splitting; (follow links to similar papers)
JEL-Codes: C00; (follow links to similar papers)
12 pages, December 18, 2014
Before downloading any of the electronic versions below
you should read our statement on
for viewing Postscript files and the
Acrobat Reader for viewing and printing pdf files.
Full text versions of the paper:
Questions (including download problems) about the papers in this series should be directed to Stein Fossen ()
Report other problems with accessing this service to Sune Karlsson ()
or Helena Lundin ().
Design by Joachim Ekebom