Centrality Computation in Weighted Networks Based on Edge-Splitting Procedure

dc.contributor.author	Belik, Ivan
dc.contributor.author	Jörnsten, Kurt
dc.date.accessioned	2014-12-18T10:12:22Z
dc.date.available	2014-12-18T10:12:22Z
dc.date.issued	2014-12
dc.identifier.issn	1500-4066
dc.identifier.uri	http://hdl.handle.net/11250/227752
dc.description.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.	nb_NO
dc.language.iso	eng	nb_NO
dc.publisher	FOR	nb_NO
dc.relation.ispartofseries	Discussion paper;40/14
dc.subject	network centrality	nb_NO
dc.subject	weighted graphs	nb_NO
dc.subject	edge splitting	nb_NO
dc.title	Centrality Computation in Weighted Networks Based on Edge-Splitting Procedure	nb_NO
dc.type	Working paper	nb_NO