{'fraction_non_alphanumeric': 0.010603048376408217, 'fraction_numerical': 0.0006626905235255136, 'mean_word_length': 5.536796536796537, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Correlation among network centrality metrics in complex networks

Complex networks represent one of the corner stones and play a central role in several Computer Science domains. Research in these networks represents a multidisciplinary approach due to the requirements to implement the statistical mechanics with graph theory and other techniques. The key property in the complex networks are their centrality measures. Network centrality is having a high impact on the network behaviors, dynamicity, and information spreading can deliver significant information about its organizations. Several metrics are developed to estimate the node centrality in complex networks. Each node centrality measure reflects its topological importance in the network among others. Adjacency matrix is used to derive and perform all the centrality measures based on several mathematical computations. Most of these measures may behave similarly in their statistical analyses. So some of these measures can be considered as redundant due to these and their complexity. This study tries to investigate the correlation between any pair of six selected centrality measures. This approach may advise to use the strongly correlated low-complexity metric as an approximation instead of the high complexity one. To perform this study a correlation analysis study is implemented on 6 estimated centrality measures for three different datasets. The alternate measures are selected according to their correlation coefficients strengths.