HITS centrality is a pair of centrality scores for vertices in a graph, consisting of an authority score and a hub score. A vertex has high authority when it is linked from high-scoring hubs, while a vertex has high hub score when it links to high-scoring authorities.
HITS, short for hyperlink-induced topic search, was introduced for ranking authoritative sources in a web hyperlink graph (Kleinberg 1999). Its two-score structure separates pages that serve as useful resource lists or directories (hubs) from pages that are pointed to as authoritative sources. Like page rank centrality, HITS is a recursive link-analysis centrality, but HITS returns coupled hub and authority scores instead of a single page-rank vector.
HITS centrality is implemented in the Wolfram Language as HITSCentrality[g], and precomputed values for many named graphs can be obtained using GraphData[graph, "HITSCentralities"].
