Kleinberg's hyperlink-induced topic search on directed networks
High authority
High hub
Both
Iteration: 0 | Click nodes to inspect
HITS computes two scores per node: authority (cited by good hubs) and hub (points to good authorities). The algorithm alternates: a(v) = Σ h(u) for u→v, h(u) = Σ a(v) for u→v, normalizing after each step. It converges to the dominant eigenvectors of AᵀA and AAᵀ respectively, revealing the bipartite structure of directed web graphs.