Wolfram Language & System 11.0 (2016)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.
BUILT-IN WOLFRAM LANGUAGE SYMBOL

gives the link-rank centralities for edges in the graph g and weight α.

gives the link-rank centralities, using weight α and initial vertex page-rank centralities β.

uses rules vw to specify the graph g.

Details and OptionsDetails and Options

• Link-rank centralities represent the likelihood that a person randomly follows a particular link on the web graph.
• Link rank is a way of measuring the importance of links between vertices.
• The link-rank centrality of an edge is the page-rank centrality of its source vertex, divided by its out-degree.
• If β is a scalar, it is taken to mean {β,β,}.
• The option can be used to control the precision used in internal computations.
• LinkRankCentrality works with undirected graphs, directed graphs, multigraphs, and mixed graphs.

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

 In[1]:=
 In[2]:=
 Out[2]=

Highlight:

 In[3]:=
 In[4]:=
 Out[4]=

Find the probability that a random surfer follows that link:

 In[1]:=
 In[2]:=
 Out[2]=

 In[3]:=
 Out[3]//Short=