Re: Fwd: [igraph] community detection

From:

Gabor Csardi

Subject:

Re: Fwd: [igraph] community detection

Date:

Wed, 28 Mar 2007 15:57:56 +0200

User-agent:

Mutt/1.5.12-2006-07-14

Vincent, thanks for the files, i'll check them later today.
I'm also considering including the code for
http://www.arxiv.org/abs/cond-mat/0408187
in igraph, that won't be too hard, the only drawback is that
we'll have more evil c++ code in the library.
So it seems that we'll have a few community detection algorithms
quite soon. Great,
Gabor
On Wed, Mar 28, 2007 at 10:56:43AM +0200, Tamas Nepusz wrote:
> 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
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
>http://lists.nongnu.org/mailman/listinfo/igraph-help
--
Csardi Gabor <address@hidden> MTA RMKI, ELTE TTK