Centrality Robustness and Link Prediction in Complex Social Networks

Søren Atmakuri Davidsen, Daniel Ortiz-Arroyo

Research output: Contribution to book/anthology/report/conference proceedingBook chapterResearchpeer-review

3 Citations (Scopus)
672 Downloads (Pure)

Abstract

This chapter addresses two important issues in social network analysis that involve uncertainty. Firstly, we present am analysis on the robustness of centrality measures that extend the work presented in Borgati et al. using three types of complex network structures and one real social network. Secondly, we present a method to predict edges in dynamic social networks. Our experimental results indicate that the robustness of the centrality measures applied to more realistic social networks follows a predictable pattern and that the use of temporal statistics could improve the accuracy achieved on edge prediction.
Original languageEnglish
Title of host publicationComputational Social Networks : Tools, Perspectives and Applications
EditorsAjith Abraham, Aboul-Ella Hassanien
Number of pages27
PublisherSpringer
Publication date2012
Pages197-224
Chapter8
ISBN (Print)978-1-4471-4047-4
ISBN (Electronic)978-1-4471-4048-1
DOIs
Publication statusPublished - 2012

Fingerprint

Dive into the research topics of 'Centrality Robustness and Link Prediction in Complex Social Networks'. Together they form a unique fingerprint.

Cite this