Re: [igraph] How to interprete weights in weighted page rank

[Tamas Nepusz]

Hello,

The weights are proportional to the probabilities that a random walker will
choose that particular edge when choosing an outgoing edge from its current
node. Therefore, edges with larger weights are assumed to be traversed more
frequently by said random walkers so they are considered more "important".

T.

On 10/31, Pavlos Basaras wrote:
> Hello,
> 
> i am using igraph to compute the weighted page rank of weighted and
> directed networks. I understand tha weights induce a cost to go through a
> link for example in betweenness or closeness so in order to acount for
> strength and not cost i invert the weight values. Should i do the same for
> weighted page rank or is it assumed for this case the weights depict the
> strength of a connection ?
> 
> 
> many thanks,
> Pavlos

> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help


-- 
T.