[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Eigenvector centrality
From: |
Paul Johnson |
Subject: |
Re: [igraph] Eigenvector centrality |
Date: |
Wed, 11 Nov 2009 01:36:01 -0600 |
On Wed, Nov 4, 2009 at 8:20 AM, Matthew Walker
<address@hidden> wrote:
> Hi Tamas, Gábor,
>
> Thank you both for your quick replies.
>
> I changed both instances of "options->start=1" to "options->start=0" inside
> igraph_eigenvector_centrality() and recompiled the library. The effect was
> indeed that iGraph now produces the correct answer (scaled). Thank you for
> that help.
>
> I would be very interested in how to deal with this in the future.
Would this be a case for optimization by simulated annealing? Begin
at the fixed point, but while iterating throw in a chance of a random
move. Or do they just refer to this as a Metropolis algorithm?
--
Paul E. Johnson
Professor, Political Science
1541 Lilac Lane, Room 504
University of Kansas