| centrality_centroid | R Documentation |
The centroid value (Koschuetzki et al. 2005) compares a node with every
other node by the number of nodes each one is closer to. With
\gamma(v, u) the number of nodes strictly closer to
v than to u,
CV(v) = \min_{u} \left[ \gamma(v, u) - \gamma(u, v) \right].
The minimum includes u = v, so the score is at most 0, and values
closer to 0 mark more central nodes.
centrality_centroid(x, mode = "all", ...)
x |
Network input accepted by |
mode |
For directed networks: |
... |
Further arguments to |
Edge weights are read as path lengths. invert_weights = TRUE uses
1/w^\alpha as the length, and weighted = FALSE
counts hops. mode sets the direction of the paths.
A named numeric vector with one score per node, in input node order.
Koschuetzki, D., Lehmann, K. A., Peeters, L., Richter, S., Tenfelde-Podehl, D., & Zlotowski, O. (2005). Centrality indices. In U. Brandes & T. Erlebach (Eds.), Network Analysis: Methodological Foundations (pp. 16-61). Springer. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1007/978-3-540-31955-9_3")}.
centrality_closeness,
centrality_closeness_vitality, centrality.
centrality_centroid(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.