Re: [igraph] PageRank & Hello.

[Martin Conte Mac Donell]

On Mon, May 11, 2009 at 2:09 PM, Gábor Csárdi <address@hidden> wrote:
> No, I think our page rank implementation is correct, at least for this graph.
>
> > g <- graph( c(0,1,1,0, 4,3,5,3,6,3,2,3) )
> > A <- get.adjacency(g)
> > page.rank(g)$vector
> [1] 0.39617763 0.39617763 0.02370186 0.11283730 0.02370186 0.02370186 
> 0.02370186
> > norm <- function(x) x/sum(x)
> > norm(eigen(t(A) * 0.85 + 0.15/7)$vectors[,1])
> [1] 0.39617763 0.39617763 0.02370186 0.11283730 0.02370186 0.02370186 
> 0.02370186
>
> Best,
> Gabor

Yes, you are right. The implementation is right but, isn't it
conceptually incorrect?

I mean:

indegree = 5 and outdegree = 0  vs indegree = 1 and outdegree = 1

Thank you,
M