[Top][All Lists]

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

Re: [igraph] leading.eigenvector.community function

From: Gábor Csárdi
Subject: Re: [igraph] leading.eigenvector.community function
Date: Thu, 25 May 2017 06:51:16 -0700

IIRC the original algorithm can be extended easily to take weights
into account.

If you think the igraph is not doing that (and the docs say that it
would), can you please provide a small example that gives you the same
results with or without (large enough) weights? Thanks.


On Wed, May 24, 2017 at 10:11 AM, Edmund Hunt <address@hidden> wrote:
> Hello,
> I have a question/comment about the leading.eigenvector.community function
> in igraph
> It has an argument for weights, but this seems to make no difference to the
> calculated clusters/resulting modularity
> Indeed I don’t think Newman’s algorithm takes edge weights into account?
> Is it the case that the weights are only used after the community detection
> has taken place, to calculate a modularity value? Is it appropriate to use
> the weights to calculate modularity, can anyone advise me what is the
> ‘right’ thing to do with a weighted, undirected network - is it definitely
> to use the weights in the modularity calculation, or is there a free choice
> Perhaps these issues could be made clearer in the function help
> Thanks
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

reply via email to

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