Directed LPA: Propagating labels in directed networks

Abstract Ignoring edge directionality and considering the graph as undirected is a common approach to detect communities in directed networks. However, it's not a meaningful way due to the loss of information captured by the edge property. Even if Leicht and Newman extended the original modularity to a directed version to address this issue, the problem of distinguishing the directionality of the edges still exists in maximizing modularity algorithms. To this direction, we extend one of the most famous scalable algorithms, namely label propagation algorithm (LPA), to a directed case, which can recognize the flow direction among nodes. To explore what properties the directed modularity should have, we also use another directed modularity, called LinkRank, and provide an empirical study. The experimental results on both real and synthetic networks demonstrate that the proposed directed algorithms can not only make use of the edge directionality but also keep the same time complexity as LPA.

[1]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Aria Rezaei,et al.  Near linear-time community detection in networks with hardly detectable community structure , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[3]  Youngdo Kim,et al.  Finding communities in directed networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Jie Cao,et al.  Enhance the Performance of Network Computation by a Tunable Weighting Strategy , 2018, IEEE Transactions on Emerging Topics in Computational Intelligence.

[5]  Aihua Li,et al.  Fast and Accurate Mining the Community Structure: Integrating Center Locating and Membership Optimization , 2016, IEEE Transactions on Knowledge and Data Engineering.

[6]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.

[7]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[8]  Jie Cao,et al.  GLEAM: a graph clustering framework based on potential game optimization for large-scale social networks , 2017, Knowledge and Information Systems.

[9]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[10]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[11]  Nicolas Dugué,et al.  Directed Louvain : maximizing modularity in directed networks , 2015 .

[12]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Amy Nicole Langville,et al.  Google's PageRank and beyond - the science of search engine rankings , 2006 .

[14]  Hocine Cherifi,et al.  Qualitative Comparison of Community Detection Algorithms , 2011, DICTAP.

[15]  E A Leicht,et al.  Community structure in directed networks. , 2007, Physical review letters.