| centrality_authority | R Documentation |
The HITS algorithm (Kleinberg 1999) assigns each node an authority score from the hubs that point to it and a hub score from the authorities it points to:
a = \lambda^{-1} A^{T} h, \qquad h = \lambda^{-1} A a .
Authorities are the dominant eigenvector of A^{T} A and hubs
the dominant eigenvector of A A^{T}.
centrality_authority(x, ...)
centrality_hub(x, ...)
x |
Network input accepted by |
... |
Further arguments to |
A holds the edge weights, or ones with weighted = FALSE.
Both scores are scaled to a maximum
of one, so they lie between 0 and 1. On an undirected network both equal
eigenvector centrality. A network without edges gives every node a score
of one. centrality_hub() returns the hub scores.
A named numeric vector with one score per node, in input node order.
Kleinberg, J. M. (1999). Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5), 604-632. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1145/324133.324140")}.
centrality_eigenvector,
centrality_pagerank, centrality.
centrality_authority(regulation_net)
centrality_hub(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.