By Yunkyu Sohn
Kim et al. (2010) demonstrate the logical flaws within directed network version of modularity function proposed by Leicht and Newman (2008). By developing link-version of PageRank, the authors introduce a new modularity function which fixes the problem of Leicht and Newman modularity. The argument for LinkRank modularity grounds upon the random walker assumption used by Rosvall and Bergstrom (2008) whose method is proven to be best so far without the use of modularity concept. Both methods produce mutually consistent results.