Centrality indices computation in dynamic networks

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

The article introduces the notion of dynamic indices as centrality measures to analyse how the importance of nodes changes in future time in dynamic networks. In particular, the dynamic closeness, dynamic graph, dynamic stress and dynamic between ness measures are investigated. We develop some algorithms for computing these indices in the dynamic case when the costs are supposed to be integers. Finally, we present some experimental results exploring the algorithms' efficiency and illustrating the variation of the dynamic between ness index for some sample dynamic networks.

Original languageEnglish
Title of host publicationProceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012
Pages202-208
Number of pages7
DOIs
Publication statusPublished - 2012
Event2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012 - Chengdu, Sichuan, China
Duration: 27 Oct 201229 Oct 2012

Publication series

NameProceedings - 2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012

Conference

Conference2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012
Country/TerritoryChina
CityChengdu, Sichuan
Period27/10/1229/10/12

Keywords

  • centrality indices
  • dynamic networks

Cite this