PageRanks

PageRanks[g]
give the page rank of the 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 page rank of a node measures the probability of a web surfer visiting that node. At any node, the surfer is assumed to follow all outlinks with equal probability; in addition, the surfer may visit any node randomly with a certain probability (TeleportProbability).
  • The page rank algorithm uses an iterative procedure to find the page ranks. When the average change in the page ranks is less than the setting for Tolerance, the iterative process terminates.

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

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

In[1]:=
Click for copyable input

This defines a small graph:

In[2]:=
Click for copyable input

This finds the page rank of each node:

In[3]:=
Click for copyable input
Out[3]=

This boosts the page rank of the page by adding more feedback links:

In[4]:=
Click for copyable input
Out[4]=
New to Mathematica? Find your learning path »
Have a question? Ask support »