This is documentation for Mathematica 6, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.2)

LinkRanks

LinkRanks[g]
gives the link ranks of the directed graph g as a rule list.
  • The following options can be given:
ToleranceAutomatictolerance used for convergence check
TeleportProbability0.15probability of visiting random nodes
RemoveSinksTruewhether to remove sinks by linking them with every node
  • The link rank of a link from vertex i to vertex j is defined as page rank of i, as given by PageRanks[g], divided by the outdegree of i.
  • The link rank reflects the probability that a random surfer follows that link.
Needs["GraphUtilities`"]
This defines a small directed graph:
In[2]:=
Click for copyable input
This calculates the link ranks:
In[3]:=
Click for copyable input
Out[3]=