HITSCentrality

HITSCentrality[g]
gives a list of authority and hub centralities for the vertices in the graph g.

Details and OptionsDetails and Options

  • HITSCentrality gives two lists of authority centralities and hub centralities for each vertex.
  • If the graph g has adjacency matrix , then authority centralities are given by TemplateBox[{a}, Transpose].a.x=lambda_1 x, where is the largest eigenvalue of TemplateBox[{a}, Transpose].a, and hub centralities are given by . »
  • The authority and hub centralities satisfy and x=1/lambda_1TemplateBox[{a}, Transpose].y. »
  • The option WorkingPrecision->p can be used to control the precision used in internal computations.
  • HITSCentrality works with undirected graphs, directed graphs, multigraphs, and mixed graphs.

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

Compute HITS hub and authority centralities:

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

Chart of the data:

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

Rate web pages using hyperlink-induced topic search:

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

Web pages with high hub centralities are connected to many other web pages:

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

Web pages with high authority centralities are connected from many other web pages:

In[4]:=
Click for copyable input
Out[4]//Short=
Introduced in 2010
(8.0)
| Updated in 2014
(10.0)