networkx.hits

hits(G, max_iter=100, tol=1e-08, nstart=None)

Return HITS hubs and authorities values for nodes.

Parameters:

G : graph

A networkx graph

max_iter : interger, optional

Maximum number of iterations in power method.

tol : float, optional

Error tolerance used to check convergence in power method iteration.

nstart : dictionary, optional

Starting value of each node for power method iteration.

Returns:

(hubs,authorities) : two-tuple of dictionaries

Two dictionaries keyed by node containing the hub and authority values.

Notes

The eigenvector calculation is done by the power iteration method and has no guarantee of convergence. The iteration will stop after max_iter iterations or an error tolerance of number_of_nodes(G)*tol has been reached.

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.

For an overview see: A. Langville and C. Meyer, “A survey of eigenvector methods of web information retrieval.” http://citeseer.ist.psu.edu/713792.html

Examples

>>> G=nx.path_graph(4)
>>> h,a=nx.hits(G)