{'fraction_non_alphanumeric': 0.014084507042253521, 'fraction_numerical': 0.0, 'mean_word_length': 5.503267973856209, '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}}
Discriminating Power of Centrality Measures in Complex Networks

Centrality metrics are one of the most fundamental tools in social network analysis and network science, and various measures for evaluating node importance metrics have been devised. However, the crucial issue of testing the discriminating power of different centrality measures is still open. In this article, we propose to assess the discriminating power of node centrality measures by using the notion of automorphism and orbit: nodes in the same orbit have identical metric scores, while nodes in different orbits should have different centrality values. Under this assumption, we present a benchmark for the discriminating power of node centrality measures. Moreover, we propose an efficient approach to evaluate centrality measures in terms of the discriminating power, which is devoid of finding orbits. Extensive experiments on real and model networks are executed to compare seven commonly used node centrality metrics.