This chapter addresses two important issues in social network analysis that involve uncertainty. Firstly, we present an analysis on the robustness of centrality measures that extends the work presented in Borgatti 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.
CITATION STYLE
Davidsen, S. A., & Ortiz-Arroyo, D. (2012). Centrality robustness and link prediction in complex social networks. In Computational Social Networks: Tools, Perspectives and Applications (Vol. 9781447140481, pp. 197–224). Springer-Verlag London Ltd. https://doi.org/10.1007/978-1-4471-4048-1_8
Mendeley helps you to discover research relevant for your work.