[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Weighted edges and leading.eigenvector.community
From: |
Gábor Csárdi |
Subject: |
Re: [igraph] Weighted edges and leading.eigenvector.community |
Date: |
Mon, 12 Sep 2011 11:17:49 -0400 |
On Sun, Sep 11, 2011 at 9:30 PM, Andrei Boutyline
<address@hidden> wrote:
> Dear all,
>
> Is there a way of getting leading.eigenvector.community to use edge weights
> when determining community structure? It looks like there was some
> discussion of generalizing this algorithm to weighted graphs a few years ago
> on this list
> (http://lists.gnu.org/archive/html/igraph-help/2009-02/msg00009.html), but I
> can't tell if this functionality was ever added.
No, it was never added, AFAIK.
> If leading.eigenvector.community cannot make use of edge weights, is there
> by chance another weighted community detection method in igraph that
> produces fairly similar results?
It depends what you mean by "similar". There are several other methods
that can make use of the weights, e.g. the spin-glass method and the
fast greedy method.
Best,
Gabor
> Thanks!
> Andrei
>
> --
> Andrei Boutyline
> University of California, Berkeley
> PhD Student, Sociology
> www.ocf.berkeley.edu/~andrei
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>
>
--
Gabor Csardi <address@hidden> MTA KFKI RMKI