Hi, it is strength. But this is easy to try, actually:
g <- graph( c(3,1, 3,2, 4,1, 4,2) ) E(g)$weight <- c(1,2, 1,2) page.rank(g) #> $vector #> [1] 0.2748538 0.3742690 0.1754386 0.1754386 and you can see that the PR of 2 is higher, because it receives the stronger edges. Gabor On Sat, Mar 14, 2015 at 2:42 AM, Yoma Uttad <[email protected]> wrote: > Hi > > I had a query regarding page.rank() function in igraph. > > Are edge weights interpreted as costs or strengths for calculating page > rank values of nodes? In other words, a high edge weight value between two > nodes is interpreted as a strong tie or weak tie? > > Regards > Amoy > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
