Distributed Community Detection for Large Scale Networks Using Stochastic Block Model

Abstract

With rapid developments of information and technology, large scale network data are ubiquitous. In this work we develop a distributed spectral clustering algorithm for community detection in large scale networks. To handle the problem, we distribute l pilot network nodes on the master server and the others on worker servers. A spectral clustering algorithm is first conducted on the master to select pseudo centers. The indexes of the pseudo centers are then broadcasted to workers to complete distributed community detection task using a SVD type algorithm. The proposed distributed algorithm has three merits. First, the communication cost is low since only the indexes of pseudo centers are communicated. Second, no further iteration algorithm is needed on workers and hence it does not suffer from problems as initialization and non-robustness. Third, both the computational complexity and the storage requirements are much lower compared to using the whole adjacency matrix. A Python package DCD (www.github.com/Ikerlz/dcd) is developed to implement the distributed algorithm for a Spark system. Theoretical properties are provided with respect to the estimation accuracy and mis-clustering rates. Lastly, the advantages of the proposed methodology are illustrated by experiments on a variety of synthetic and empirical datasets.

References in corpus (8)

• Semi-Supervised Classification with Graph Convolutional Networks
• Fast community detection by SCORE
• Distributed Estimation and Inference with Statistical Guarantees
• Communication-efficient sparse regression: a one-shot approach
• Distributed Estimation, Information Loss and Exponential Families
• Co-clustering for directed graphs: the Stochastic co-Blockmodel and spectral algorithm Di-Sim
• Scalable and Robust Community Detection with Randomized Sketching
• Consistency of Spectral Clustering on Hierarchical Stochastic Block Models