centrality_bridging: Bridging Centrality

View source: R/centrality.R

centrality_bridgingR Documentation

Bridging Centrality

Description

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.

Usage

centrality_bridging(x, ...)

Arguments

x

Network input accepted by centrality.

...

Further arguments to centrality, such as directed and normalized.

Details

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.

Value

A named numeric vector with one score per node, in input node order.

References

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")}.

See Also

centrality_local_bridging, centrality_betweenness, centrality.

Examples

centrality_bridging(regulation_net)

cograph documentation built on Nov. 19, 2026, 5:07 p.m.