gives a list of authority and hub centralities for the vertices in the graph g.
uses rules vw to specify the graph g.
Details 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 , where is the largest eigenvalue of , and hub centralities are given by . »
- The authority and hub centralities satisfy and . »
- 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.
Examplesopen allclose all
Basic Examples (2)
Properties & Relations (4)
Introduced in 2010
(8.0)| Updated in 2015