• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Norges Handelshøyskole
  • Department of Business and Management Science
  • Discussion papers (FOR)
  • View Item
  •   Home
  • Norges Handelshøyskole
  • Department of Business and Management Science
  • Discussion papers (FOR)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Centrality Computation in Weighted Networks Based on Edge-Splitting Procedure

Belik, Ivan; Jörnsten, Kurt
Working paper
Thumbnail
View/Open
4014.pdf (907.5Kb)
URI
http://hdl.handle.net/11250/227752
Date
2014-12
Metadata
Show full item record
Collections
  • Discussion papers (FOR) [514]
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.
Publisher
FOR
Series
Discussion paper;40/14

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit