Scandinavian Working Papers in Economics

Discussion Papers,
Norwegian School of Economics, Department of Business and Management Science

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

Ivan Belik () and Kurt Jörnsten ()
Additional contact information
Ivan Belik: Dept. of Business and Management Science, Norwegian School of Economics, Postal: NHH , Department of Business and Management Science, Helleveien 30, N-5045 Bergen, Norway
Kurt Jörnsten: Dept. of Business and Management Science, Norwegian School of Economics, Postal: NHH , Department of Business and Management Science, Helleveien 30, N-5045 Bergen, Norway

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

JEL-codes: C00

12 pages, December 18, 2014

Full text files

227753  

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

This page generated on 2018-01-23 23:36:09.