PageRanks

As of Version 10, all the functionality of the GraphUtilities package is built into the Wolfram System. >>

PageRanks[g]
give the page rank of the graph g as a rule list.

DetailsDetails

  • PageRanks functionality is now available in the built-in Wolfram Language function PageRankCentrality.
  • 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.

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

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]=

has been superseded by PageRankCentrality:

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
Out[2]=