LinkRankMatrix

LinkRankMatrix[g]
returns the link rank of the graph g, in the form of a sparse matrix. The link rank of an edge is defined as the PageRanks of u, divided by the outdegree of u.

更多信息更多信息

  • 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.

范例范例打开所有单元关闭所有单元

基本范例 (1)基本范例 (1)

This shows a small network of web pages:

In[1]:=
Click for copyable input
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]=
New to Mathematica? Find your learning path »
Have a question? Ask support »