Overlapping community detection is progressively becoming an important issue in complex networks. Many in-memory overlapping community detection algorithms have been proposed for graphs with thousands of nodes. However, analyzing massive graphs with millions of nodes is impossible for the traditional algorithm. In this paper, we propose MR-ECOCD, a novel distributed computation algorithm using ...

How can we approximate sparse graphs and sequences of (with unbounded average degree)? We consider convergence in the first k moments graph spectrum (equivalent to numbers closed -walks) appropriately normalized. introduce a simple random model that captures limiting spectra many interest, including sequence hypercube graphs. The overlapping communities (ROC) is specified by distribution on pai...