| centrality_eigenvector | R Documentation |
Eigenvector centrality (Bonacich 1972) scores a node by the scores of the nodes that point to it. The scores form the dominant eigenvector of the transposed weight matrix:
\lambda x = A^{T} x.
The vector is scaled to a maximum of one.
centrality_eigenvector(x, ...)
x |
Network input accepted by |
... |
Further arguments to |
A holds the edge weights, or ones with weighted = FALSE.
On a directed network a node gains
standing from its incoming edges. The scores lie between 0 and 1. A
network without edges gives every node a score of one.
A named numeric vector with one score per node, in input node order.
Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113-120. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1080/0022250X.1972.9989806")}.
centrality_pagerank, centrality_alpha,
centrality_authority, centrality.
centrality_eigenvector(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.