| centrality_flow_betweenness | R Documentation |
Flow betweenness (Freeman, Borgatti and White 1991) sums, over pairs of
other nodes s and t, the flow that passes through the node
when a maximum flow is sent from s to t with the edge weights
as capacities.
centrality_flow_betweenness(x, ...)
x |
Network input accepted by |
... |
Further arguments to |
The measure requires the igraph package and raises an error of class
cograph_needs_igraph without it. The flow through a node is read
from the maximum flow that igraph::max_flow() returns. On a
directed network the sum runs over ordered pairs along the edge direction,
and on an undirected network over unordered pairs. weighted = FALSE
gives every edge capacity one, and invert_weights = TRUE uses
1/w^\alpha as the capacity.
A named numeric vector with one score per node, in input node order.
Freeman, L. C., Borgatti, S. P., & White, D. R. (1991). Centrality in valued graphs: A measure of betweenness based on network flow. Social Networks, 13(2), 141-154. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1016/0378-8733(91)90017-N")}.
centrality_betweenness,
centrality_current_flow_betweenness,
centrality.
centrality_flow_betweenness(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.