Scandinavian Working Papers in Economics
HomeAboutSeriesSubject/JEL codesAdvanced Search
Department of Business and Management Science, Norwegian School of Economics (NHH) Discussion Papers, Department of Business and Management Science, Norwegian School of Economics (NHH)

No 2014/40:
Centrality Computation in Weighted Networks Based on Edge-Splitting Procedure

Ivan Belik () 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 copyright.
Download GhostScript for viewing Postscript files and the Acrobat Reader for viewing and printing pdf files.

Full text versions of the paper:

227753    PDF-file
Download Statistics

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 ().

Programing by
Design by Joachim Ekebom

Handle: RePEc:hhs:nhhfms:2014_040 This page was generated on 2014-12-18 11:55:19