Refinement of Modularity Function for Directed Networks Using LinkRank

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.

Advertisements

One response to “Refinement of Modularity Function for Directed Networks Using LinkRank

  1. There is also a new paper from the Barabási lab that may be coming out at Nature using a link-based modularity detection algorithm. Stay tuned!

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s