Abstract: With the development of the society,the scale of data and networks are increasing rapidly．As one of the effective ways of studying network structure,community detecting is a significant issue in deep understanding of large scale networks．Based on the methods of non-overlapping community detecting in directed networks and overlapping community detecting in undirected networks,an overlapping community detecting algorithm in directed networks was proposed in this paper．The basic idea of this method is to divide a network according to two parameters:directed weight and belonging degree of nodes．The influences of these parameters on partition are discussed and the optimal parameters are obtained．The performance of the proposed algorithm was tested and compared with other algorithms on two real networks and one computer-generated network．Experimental results show that the algorithm presented in this paper is rather efficient to detect overlapping communities of directed network.

Key words: Directed networks,Community detection,Modularity,Overlapping community