A novel overlapping community detection algorithm of weighted networks

摘要

The community structure is a vital property of complex networks. As special networks the weighted networks also have community structure. Nowadays the studies of overlapping community draw attentions of researchers. However, the scale of networks become huge, so it requires the algorithm has lower time complexity and higher classification accuracy. Many existing algorithms cannot meet these two requirements at the same time. So we propose a novel overlapping community detection algorithm. Firstly we apply maximum degree node and its some special adjacent nodes as the initial community, and then expand the initial community by adding eligible nodes to it, finally other communities can be found by repeating these two steps. Experiments results show that our algorithm can detect overlapping community structure from weighted networks successfully, and also reveal that our method has higher division accuracy and lower time complexity than many previously proposed methods.