Fwd: [igraph] community detection

[Tamas Nepusz]

Re-sending it again, I sent it from a wrong address for the first time :)

---------- Forwarded message ----------
Date: Mar 28, 2007 10:55 AM
Subject: Re: [igraph] community detection
To: Help for igraph users <address@hidden>


Hi Vincent,

> Gabor, I was wondering what is the status of the development on alternatives
> to the spinglass based implementation for community detection?
I am now working on a native C implementation of the algorithm
proposed in the following paper:
http://arxiv.org/abs/cond-mat/0309508

And Newman's edge betweenness based algorithm is not too difficult to
implement using existing igraph calls -- edge betweenness calculation
is already implemented, and all you have to do in every step is to
remove the edge with the largest edge betweenness. (I don't know if
this is implemented in the R interface, it is definitely not in the C
layer and I've already implemented it in the Python interface).

Porting the Markov Cluster Algorithm (http://www.micans.org/mcl) which
gives superior results for large directed graphs is also on the way,
but it will mean a lot of work.

--
Tamas


--
Tamas