This documents the development version of NetworkX. Documentation for the current release can be found here.
Returns HITS hubs and authorities values for nodes.
The HITS algorithm computes two numbers for a node.
Authorities estimates the node value based on the incoming links.
Hubs estimates the node value based on outgoing links.
A NetworkX graph
- normalizedbool (default=True)
Normalize results by the sum of all of the values.
- (hubs,authorities)two-tuple of dictionaries
Two dictionaries keyed by node containing the hub and authority
The eigenvector calculation uses NumPy’s interface to LAPACK.
The HITS algorithm was designed for directed graphs but this
algorithm does not check if the input graph is directed and will
execute on undirected graphs.
A. Langville and C. Meyer,
“A survey of eigenvector methods of web information retrieval.”
Authoritative sources in a hyperlinked environment
Journal of the ACM 46 (5): 604-32, 1999.
authorities are given by the eigenvectors corresponding to the
maximum eigenvalues of the hubs_matrix and the authority_matrix, respectively.
authority matrices are computed from the adjancency
>>> adj_ary = nx.to_numpy_array(G)
>>> hubs_matrix = adj_ary @ adj_ary.T
>>> authority_matrix = adj_ary.T @ adj_ary
hits_numpy maps the eigenvector corresponding to the maximum eigenvalue
of the respective matrices to the nodes in
>>> hubs, authority = hits_numpy(G)