| centrality_betweenness | R Documentation |
Betweenness centrality (Freeman 1977) sums, over pairs of other nodes, the fraction of shortest paths between them that pass through the node:
B(v) = \sum_{s \ne v \ne t} \frac{\sigma_{st}(v)}{\sigma_{st}},
where \sigma_{st} is the number of shortest paths from
s to t and \sigma_{st}(v) the number of
those through v.
centrality_betweenness(x, ...)
x |
Network input accepted by |
... |
Further arguments to |
On a directed network the sum runs over ordered pairs along the edge
direction, and on an undirected network over unordered pairs. Edge weights
are read as path lengths, and invert_weights = TRUE uses
1/w^\alpha instead. weighted = FALSE uses hop
counts. cutoff drops paths longer
than the given length. normalized = TRUE divides the scores by
their maximum.
A named numeric vector with one score per node, in input node order.
Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40(1), 35-41. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.2307/3033543")}.
centrality_load, centrality_stress,
centrality.
centrality_betweenness(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.