With the unceasing expanding of network scale

many classic detection algorithms of overlapping communities cannot work efficiently in large-scale complex network.Detecting the overlapping community algorithm based on vital node expanding in parallel framework GraphLab (DOCVN) is introduced to identify the overlapping communities.In this algorithm

nodes with high PageRank value are regarded as vital nodes

and then the affiliation degree of other nodes to these vital nodes are computed.After that

kernel communities and expanding communities are identified respectively.Finally

the kernel communities and expanding communities are combined into some overlapping communities by judging whether they connect tightly.And the importance weight of each node in its community is also computed.Experimental results show that the algorithm is more effective than the existing parallel algorithms like PD (Propinquity Dynamics) to identify large-scale overlapping communities.