THIS IS DOCUMENTATION FOR AN OBSOLETE PRODUCT.
SEE THE DOCUMENTATION CENTER FOR THE LATEST INFORMATION.

DOCUMENTATION CENTER SEARCH

GRAPH UTILITIES PACKAGE SYMBOL

LinkRanks

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

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.

This defines a small directed graph:

This calculates the link ranks:

Needs["GraphUtilities`"]

This defines a small directed graph:

This calculates the link ranks:

Out[3]=