Community Identification in Directed Networks

The most common approach to community identification of directed networks has been to ignore edge directions and apply methods developed for undirected networks. Recently, Leicht and Newman published a work on community identification of directed networks, which is a generalization of the widely used community finding technique of modularity maximization in undirected networks. However, our investigation of this method shows that the method they used does not exploit direction information as they proposed. In this work, we propose an alternative method which exploits the directional information of links properly.