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

LinkRankMatrix

LinkRankMatrix[g]
returns the link rank of the graph g, in the form of a sparse matrix. The link rank of an edge u->v is defined as the PageRanks of u, divided by the outer-degree of u.
  • 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.
  • LinkRankMatrix has the same options as PageRanks.