@graphty/algorithms / index / personalizedPageRank
Function: personalizedPageRank() ​
personalizedPageRank(
s,personalization,o?):PageRankResult
Defined in: indexed/pagerank.ts:60
Personalized PageRank, as the legacy function computes it: the personalization vector, normalised to sum 1, replaces the uniform 1 / n in the teleport, and each node receives d * dangling / n of the dangling mass scaled by its personalization. That keeps only a 1 / n share of the dangling mass, so on a graph with a dangling node the scores sum to less than 1 (networkx spreads all of it). An all-zero vector gives plain PageRank, as the legacy function does for an empty list of personal nodes.
Parameters ​
s ​
GraphSnapshot
The snapshot
personalization ​
F64 | F32
One finite, non-negative mass per node index
o? ​
PageRankOptions = {}
Algorithm options
Returns ​
The scores, the iteration count and the convergence flag