Fast approximation of centrality
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Adaptive on-line page importance computation
WWW '03 Proceedings of the 12th international conference on World Wide Web
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Visual analysis of network centralities
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
A socio-aware overlay for publish/subscribe communication in delay tolerant networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Second order centrality: Distributed assessment of nodes criticity in complex networks
Computer Communications
On the impact of users availability in OSNs
Proceedings of the Fifth Workshop on Social Network Systems
Betweenness centrality on GPUs and heterogeneous architectures
Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units
Local clustering in provenance graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
The increase of interest in the analysis of contemporary social networks, for both academic and economic reasons, has highlighted the inherent difficulties in handling large and complex structures. Among the tools provided by researchers for network analysis, the centrality notion, capturing the importance of individuals in a graph, is of particular interest. Despite many definitions and implementations of centrality, no clear advantage is given to a particular paradigm for the study of social network characteristics. In this paper we review, compare and highlight the strengths of different definitions of centralities in contemporary social networks.