{'fraction_non_alphanumeric': 0.011124845488257108, 'fraction_numerical': 0.0, 'mean_word_length': 5.428571428571429, '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}}
Scalable MCMC in Degree Corrected Stochastic Block Model

Community detection from graphs has many applications in machine learning, biological and social sciences. While there is a broad spectrum of literature based on various approaches, recently there has been a significant focus on inference algorithms for statistical models of community structure. These algorithms strive to solve an inference problem based on a generative model of the network. Recent advances in stochastic gradient MCMC have played a crucial role in improving the scalability of these techniques. In this paper, we propose a version of a degree corrected stochastic block model and present an MCMC based inference algorithm. Experimental results on several real world networks demonstrate the effectiveness of the proposed approach.