摘要：Real social networks usually have some structural features of the complex networks, such as community structure, the scale-free degree distribution, clustering, "small world" network, dynamic evolution and so on. A new community detecting algorithm for directed and weighted social networks is proposed in this paper. Due to the use of more reference information, the accuracy of the algorithm is better than some of the typical detecting algorithms. And because of the use of heap structure and multi-task modular architecture, the algorithm also got a high computational efficiency than other algorithms. The effectiveness and efficiency of the algorithm is validated by experiments on real social networks. Based on the theories and models of complex networks, the features of the real large social networks are analyzed.
