此为 Mathematica 7 文档,内容基于更早版本的 Wolfram 语言
查看最新文档(版本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.
This shows a small network of web pages:
Needs["GraphUtilities`"]
In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=
This calculates the link ranks:
In[4]:=
Click for copyable input
Out[4]=
This replots the network with link rank information:
In[5]:=
Click for copyable input
Out[5]=