| centrality_bridging | R Documentation |
Bridging centrality (Hwang et al. 2008) is the product of betweenness
B(v) and the bridging coefficient, which compares the inverse degree
of a node with the inverse degrees of its neighbors:
BrC(v) = B(v) \frac{1/k_v}{\sum_{u \in N(v)} 1/k_u}.
High values mark nodes that lie on many shortest paths and connect densely linked regions.
centrality_bridging(x, ...)
x |
Network input accepted by |
... |
Further arguments to |
The betweenness factor reads edge weights as path lengths and follows the
edge direction of a directed network. weighted = FALSE uses hop
counts, and invert_weights has no effect. The
degrees are total degrees, and on a directed network a reciprocated
neighbor enters the sum twice. An isolated node scores 0.
A named numeric vector with one score per node, in input node order.
Hwang, W., Kim, T., Ramanathan, M., & Zhang, A. (2008). Bridging centrality: Graph mining from element level to group level. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 336-344). \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1145/1401890.1401934")}.
centrality_local_bridging,
centrality_betweenness, centrality.
centrality_bridging(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.