[Top][All Lists]

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

Re: [igraph] Choosing between different methods of detecting communities

From: 凌琛
Subject: Re: [igraph] Choosing between different methods of detecting communities
Date: Wed, 3 Oct 2012 23:02:02 +0800

I know that the algorithm is not deterministic. In my case, the graph only have tens of nodes, while the results are very different.

In igraph, the unweighted version results in only one community; in SNAP, there are quite a few communities.

And the weighted version in Igrahp generated a bunch of community, similar to the results in SNAP unweigted version. That is why i am doubt that whether i used the method correctly.

Best Regards

On Oct 3, 2012 10:47 PM, "Tamás Nepusz" <address@hidden> wrote:
> I am not sure, because the results are different from the same algorithm in SNAP, which also implement Girvan-Newman's algorithm while only unweighted version.

The edge betweenness algorithm is not deterministic in the sense that it is free to make a (possibly random) choice when there are two or more edges with the same edge betweenness. Therefore, it is not guaranteed that different implementations give exactly the same results, unless there are no ties in edge betweenness values throughout the course of the algorithm.


igraph-help mailing list

reply via email to

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