[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] leading.eigenvector.community
From: |
Csardi Gabor |
Subject: |
Re: [igraph] leading.eigenvector.community |
Date: |
Sat, 30 Aug 2008 12:07:39 +0200 |
User-agent: |
Mutt/1.5.9i |
Hmmm, I'm sorry for the delay, somehow I missed this email.... :(
The manual is incorrect, the 'eigenvector' and the 'eigenvalue' are
only returned by leading.eigenvector.community.step() and there is
no option for them, they are always returned.
If you want to have the eigenvector/eigenvalue for every split, then
call igraph.eigenvector.community.step() in a loop, until there
is a split. The API is not very nice, but it should work.
You'll need to write a small loop, that recursively tries to split
every "community", until there are no more splits. Please tell me if
you experience more problems.
Best,
Gabor
On Fri, Aug 08, 2008 at 06:21:54PM +0900, MATSUDA, Noriyuki wrote:
> Hello:
>
> I am using igraph 0.5.1 and now working on
> leading.eigenvector.community() and
> community.le.to.membership().
>
> 1) I want to obtain the largest eigenvalue and the associated
> vectors. The manual
> says
> eigenvector The eigenvector of the community matrix,
> or NULL if the eigenvector argument was FALSE.
> eigenvalue The largest positive eigenvalue of the
> modularity matrix.
> But, where should I put that argument. I put eigenvector=T in
> the two functions in vein.
> 2) It will be valuable if leading.eigenvector.community() returns
> the modularity at each
> merge.
>
> Thanks in advance as usual.
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
--
Csardi Gabor <address@hidden> MTA RMKI, ELTE TTK