logo
  • Install
  • Tutorial
  • Reference
  • Releases
  • Developer
  • Gallery
  • Guides
    • devel (latest)
    • current (stable)
  • Introduction
  • Graph types
  • Algorithms
    • Approximations and Heuristics
    • Assortativity
    • Asteroidal
    • Bipartite
    • Boundary
    • Bridges
    • Centrality
    • Chains
    • Chordal
    • Clique
    • Clustering
    • Coloring
    • Communicability
    • Communities
    • Components
    • Connectivity
    • Cores
    • Covering
    • Cycles
    • Cuts
    • D-Separation
    • Directed Acyclic Graphs
    • Distance Measures
    • Distance-Regular Graphs
    • Dominance
    • Dominating Sets
    • Efficiency
    • Eulerian
    • Flows
    • Graph Hashing
    • Graphical degree sequence
    • Hierarchy
    • Hybrid
    • Isolates
    • Isomorphism
    • Link Analysis
    • Link Prediction
    • Lowest Common Ancestor
    • Matching
    • Minors
    • Maximal independent set
    • non-randomness
    • Moral
    • Node Classification
    • Operators
    • Planarity
    • Planar Drawing
    • Reciprocity
    • Regular
    • Rich Club
    • Shortest Paths
    • Similarity Measures
    • Simple Paths
    • Small-world
    • s metric
    • Sparsifiers
    • Structural holes
    • Summarization
    • Swap
    • Threshold Graphs
    • Tournament
    • Traversal
    • Tree
    • Triads
    • Vitality
    • Voronoi cells
    • Wiener index
  • Functions
  • Graph generators
  • Linear algebra
  • Converting to and from other data formats
  • Relabeling nodes
  • Reading and writing graphs
  • Drawing
  • Randomness
  • Exceptions
  • Utilities
  • Glossary

networkx.algorithms.link_analysis.hits_alg.hits_numpy¶

hits_numpy(G, normalized=True)[source]¶

Returns HITS hubs and authorities values for nodes.

Deprecated since version 2.6: hits_numpy is deprecated and will be removed in networkx 3.0.

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.

Parameters
Ggraph

A NetworkX graph

normalizedbool (default=True)

Normalize results by the sum of all of the values.

Returns
(hubs,authorities)two-tuple of dictionaries

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

Notes

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.

References

1

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

2

Jon Kleinberg, Authoritative sources in a hyperlinked environment Journal of the ACM 46 (5): 604-32, 1999. doi:10.1145/324133.324140. http://www.cs.cornell.edu/home/kleinber/auth.pdf.

Examples

>>> G = nx.path_graph(4)

The hubs and authorities are given by the eigenvectors corresponding to the maximum eigenvalues of the hubs_matrix and the authority_matrix, respectively.

The hubs and authority matrices are computed from the adjancency matrix:

>>> 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 G:

>>> hubs, authority = nx.hits_numpy(G)

© Copyright 2004-2021, NetworkX Developers.

Created using Sphinx 4.0.3.