[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] Re: Question about community detection

From: zhengjun chen
Subject: Re: [igraph] Re: Question about community detection
Date: Tue, 22 Dec 2009 08:58:56 -0500

So, what is an appropriate value for the number of iterations? 
It is data type is long int, the largest value is: 2^31-1.

On Tue, Dec 22, 2009 at 5:59 AM, Tamas Nepusz <address@hidden> wrote:
> After I reset the max iteration value, the program runs slowly....
It's no surprise, since the algorithm takes more steps in order to find an eigenvector.

> In order to find the best community division, should I use a loop to compute modularity for each step?
No, the algorithm does that automatically (i.e., it splits communities further and further as long as it can increase the modularity). Just set the steps value to the number of vertices.

By the way, I think that other community detection methods (i.e. igraph_community_fastgreedy) are faster and yield similar results, so if the leading eigenvector method is too slow for you, try another one.


igraph-help mailing list


Graduate research assistant
Dept of Computer Science and Engineering
Lehigh University

reply via email to

[Prev in Thread] Current Thread [Next in Thread]