Re: [igraph] Community detection: deterministic vs non-deterministic

[Gábor Csárdi]

On Wed, May 16, 2012 at 12:44 PM, R N <address@hidden> wrote:
> Just a quick question: is 'infomap' CD method in igraph-0.6
> deterministic or not?

It is not, as far as I know.

> I run infomap algorithm a number of times on the same graph, and the results
> are different in many runs, but there are also identical partitions among 
> those
> many runs, i.e., it looks like "not enough non-deterministic".
>
> And, to be sure: is the following classification correct?
> Deterministic CD methods: fast greedy, edge betweenness, walktrap;
> Non-deterministic: label propagation, spinglass, infomap.

walktrap is definitely non-deterministic. edge betweenness and fast
greedy might be non-deterministic as well, when one needs to break
ties.

Gabor

> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help



-- 
Gabor Csardi <address@hidden>     MTA KFKI RMKI