|
From: | Tamás Nepusz |
Subject: | Re: [igraph] trouble in understanding the algorithm of random walks in community detection |
Date: | Fri, 9 May 2014 12:06:16 +0200 |
Hello,
I don’t know whether this is the same as the idea in the paper, but igraph does it a bit differently (even though it mostly uses the original code published by the authors). igraph simply performs all the merges until there is only one community left, and then calculates the modularity score for all the partitions (well, actually, it calculates the modularity *during* the merges, but this is irrelevant), and then chooses the partition that yields the highest modularity. Cheers, T. |
[Prev in Thread] | Current Thread | [Next in Thread] |