{'fraction_non_alphanumeric': 0.01264591439688716, 'fraction_numerical': 0.0, 'mean_word_length': 5.596153846153846, '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}}
Community structure detection based on Potts model and network's spectral characterization

The Potts model was used to uncover community structure in complex networks. However, it could not reveal much important information such as the optimal number of communities and the overlapping nodes hidden in networks effectively. Differently from the previous studies, we established a new framework to study the dynamics of Potts model for community structure detection by using the Markov process, which has a clear mathematic explanation. Based on our framework, we showed that the local uniform behavior of spin values could naturally reveal the hierarchical community structure of a given network. Critical topological information regarding the optimal community structure could also be inferred from spectral signatures of the Markov process. A two-stage algorithm to detect community structure is developed. The effectiveness and efficiency of the algorithm has been theoretically analyzed as well as experimentally validated.