Graph Utilities Package Symbol

LinkRanks

LinkRanks[g]
gives the link ranks of the directed graph g as a rule list.

To use LinkRanks, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].

Tolerance	Automatic	tolerance used for convergence check
TeleportProbability	0.15	probability of visiting random nodes
RemoveSinks	True	whether to remove sinks by linking them with every node

The link rank of a link from vertex to vertex is defined as page rank of i, as given by PageRanks[g], divided by the outdegree of i.

Needs["GraphUtilities`"]

This defines a small directed graph:

This calculates the link ranks: