PageRankCentrality

PageRankCentrality[g, ]
gives a list of page-rank centralities for the vertices in the graph g and weight .

PageRankCentrality[g, , ]
gives a list of page-rank centralities, using weight and initial centralities .

Details and OptionsDetails and Options

  • PageRankCentrality gives a list of centralities that are solutions to c=alpha TemplateBox[{a}, Transpose].d.c+beta, where is the adjacency matrix of g and is the diagonal matrix consisting of , where is the out-degree of the ^(th) vertex. »
  • If is a scalar, it is taken to mean .
  • PageRankCentrality[g, ] is equivalent to PageRankCentrality[g, , 1/VertexCount[g]].
  • Page-rank centralities are normalized.
  • The option WorkingPrecision->p can be used to control the precision used in internal computations.

ExamplesExamplesopen allclose all

Basic Examples (2)Basic Examples (2)

Compute page-rank centralities:

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

Highlight:

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

Find the probability that a person randomly clicking on hyperlinks will arrive at a particular page:

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

Rank web pages, the most visible pages first:

In[3]:=
Click for copyable input
Out[3]//Short=
New in 8 | Last modified in 9
New to Mathematica? Find your learning path »
Have a question? Ask support »