Calculates the PageRank centrality for each node in the network. PageRank is a measure of the importance of a node in a network. It is based on the idea that a node is important if it is linked to by other important nodes. The algorithm is iterative and the importance of a node is calculated as the sum of the importance of the nodes that link to it. The importance of a node is then distributed to the nodes it links to. The algorithm is run until convergence. A damping factor is used to avoid the problem of dead ends.

For more information about the algorithm and its parameters see the wikipedia entry or the original paper here.

​
directed
boolean

Whether the links are directed or not.

​
damping
number

The damping factor. 1 - damping is the PageRank value for nodes with no incoming links. It is also the probability of resetting the random walk to a uniform distribution in each step.

Values must be in the following range:

0 ≤ damping ≤ 1

Was this page helpful?