| centrality_load | R Documentation |
Load centrality (Goh et al. 2001) sends one unit of load from every node to every other node along shortest paths. At each branching the load is split equally among the shortest-path predecessors, and the score of a node is the total load that passes through it.
centrality_load(x, ...)
x |
Network input accepted by |
... |
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. Paths follow edge direction on a
directed network. The values equal sna::loadcent(), which credits
the endpoints of each path as well as the intermediate nodes, so the
scores are larger than betweenness.
A named numeric vector with one score per node, in input node order.
Goh, K.-I., Kahng, B., & Kim, D. (2001). Universal behavior of load distribution in scale-free networks. Physical Review Letters, 87(27), 278701. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1103/PhysRevLett.87.278701")}.
centrality_betweenness,
centrality_stress, centrality.
centrality_load(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.