| centrality_lin | R Documentation |
Lin centrality divides the squared number of nodes a node reaches by the sum of its distances to them:
L(i) = \frac{r_i^2}{\sum_{j \in R_i} d_{ij}},
where R_i is the set of r_i nodes reachable from i. The
score is defined on disconnected networks.
centrality_lin(x, mode = "all", ...)
x |
Network input accepted by |
mode |
Direction for directed networks: |
... |
Further arguments to |
Edge weights are read as distances. weighted = FALSE uses hop
counts, and invert_weights = TRUE converts a weight w to the
distance 1/w^\alpha. mode = "all" treats edges as
undirected, "out" uses distances from the node and "in"
distances to it. A node that reaches no other node scores 0, and a
single-node network gives NA. On undirected networks the values
equal centiserve::lincent().
A named numeric vector with one score per node, in input node order.
centrality_closeness,
centrality_harmonic, centrality.
centrality_lin(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.