| centrality_leverage | R Documentation |
Leverage centrality (Joyce et al. 2010) compares the degree of a node with the degrees of its neighbors:
l_i = \frac{1}{|N(i)|} \sum_{j \in N(i)} \frac{k_i - k_j}{k_i + k_j}.
Positive values mark nodes with more ties than their typical neighbor.
centrality_leverage(x, mode = "all", ...)
x |
Network input accepted by |
mode |
Direction for directed networks: |
... |
Further arguments to |
Edge weights are ignored. mode selects both the degree and the
neighbor set, and with mode = "all" on a directed network the
degree is in plus out. The score lies between -1 and 1. An isolated node
is NaN. On undirected networks the values equal
centiserve::leverage().
A named numeric vector with one score per node, in input node order.
Joyce, K. E., Laurienti, P. J., Burdette, J. H., & Hayasaka, S. (2010). A new measure of centrality for brain networks. PLoS ONE, 5(8), e12200. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1371/journal.pone.0012200")}.
centrality_degree,
centrality_neighborhood_connectivity,
centrality.
centrality_leverage(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.