Correlations among Game of Thieves and other centrality measures in complex networks
arXiv:2012.13013 · doi:10.1007/978-3-030-67197-6_3
Abstract
Social Network Analysis (SNA) is used to study the exchange of resources among individuals, groups, or organizations. The role of individuals or connections in a network is described by a set of centrality metrics which represent one of the most important results of SNA. Degree, closeness, betweenness and clustering coefficient are the most used centrality measures. Their use is, however, severely hampered by their computation cost. This issue can be overcome by an algorithm called Game of Thieves (GoT). Thanks to this new algorithm, we can compute the importance of all elements in a network (i.e. vertices and edges), compared to the total number of vertices. This calculation is done not in a quadratic time, as when we use the classical methods, but in polylogarithmic time. Starting from this we present our results on the correlation existing between GoT and the most widely used centrality measures. From our experiments emerge that a strong correlation exists, which makes GoT eligible as a centrality measure for large scale complex networks.
References in corpus (11)
- Emergence of scaling in random networks
- The structure of scientific collaboration networks
- Renormalization group analysis of the small-world network model
- Growing Scale-Free Networks with Tunable Clustering
- Consistency and differences between centrality measures across distinct classes of networks
- A Novel Measure of Edge Centrality in Social Networks
- Mixing local and global information for community detection in large networks
- Enhancing community detection using a network weighting strategy
- Correlation between centrality metrics and their application to the opinion model
- Analyzing complex networks through correlations in centrality measurements
- An Analysis of Centrality Measures for Complex and Social Networks