Erschienen in:NHH Dept. of Business and Management Science Discussion Paper ; No. 2014/40
Umfang:
1 Online-Ressource (13 p)
Sprache:
Englisch
DOI:
10.2139/ssrn.2540487
Identifikator:
Entstehung:
Anmerkungen:
Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments December 18, 2014 erstellt
Beschreibung:
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