Centrality Computation in Weighted Networks Based on Edge-Splitting Procedure
Working paper
Åpne
Permanent lenke
http://hdl.handle.net/11250/227752Utgivelsesdato
2014-12Metadata
Vis full innførselSamlinger
- Discussion papers (FOR) [564]
Sammendrag
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.