MIRACLE: A multiple independent random walks community parallel detection algorithm for big graphs

Community detection is a common problem in various types of complex networks. With the emerging of large scale real networks like social networks, community detection meets new technology challenges of extremely large computational cost and lack of prior information. Although several literatures recently try to solve these new challenges, they still have limitations of parallelism and running time. With the scale of data increases sharply, the parallelism is necessary but few codes exist. In this work, we analyze the process of random walking in graphs, and observe that the weight of an edge gotten by processing the vertices visited by the walker could be an indicator to measure the closeness of vertex connection. Based on this finding, we first propose a novel parallel computing community detection algorithm for big unweighted undirected graphs in the true sense. The algorithm consists of three steps, including random walking using multiple independent random walks, weight calculating for edges and community detecting. The time complexity of our algorithm is O(nlogn)O(nlogn) without prior information. In order to implement our parallel computing algorithm efficiently, we also propose a novelty graph partition model. Experimental results show that our algorithm is capable of detecting the community structure and the overlapping parts of communities in real-world effectively (reduce the running time by 400 times at least), and handling the challenges of community detection in big graph era.