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


  • To use , you first need to load the Graph Utilities Package using Needs["GraphUtilities`"].
  • 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.
  • has the same options as PageRanks.

ExamplesExamplesopen allclose all

Basic Examples (1)Basic Examples (1)

Click for copyable input

This defines a small directed graph:

Click for copyable input

This calculates the link ranks:

Click for copyable input
New to Mathematica? Find your learning path »
Have a question? Ask support »