centrality_extended_local_bridging: Extended local bridging centrality

In cograph: Analysis and Visualization of Complex Networks

Extended local bridging centrality

Description

Macker's two-hop localized bridging centrality multiplies betweenness of the focal node in its induced closed two-hop neighborhood by its bridging coefficient. Degrees for that coefficient come from the original graph. The ego network includes every edge between the selected vertices. Its shortest paths can be up to four edges long; this is not global betweenness with a path-length cutoff of two. Betweenness uses unordered pairs, excludes endpoints, and is not normalized by ego-network size.

Usage

centrality_extended_local_bridging(x, ...)

Arguments

x	Network input accepted by centrality.
...	Additional arguments to centrality. normalized = TRUE divides final scores by their maximum; all-zero scores remain zero. Ego betweenness is never scaled by ego size.

Details

Uses the same simple undirected unweighted projection and zero conventions as centrality_localized_bridging. Macker's separate weighted model uses link quality for degree and costs for paths; that model is outside this implementation. Native breadth-first path counts cost O(sum over ego networks of n_ego times (n_ego + m_ego)), at worst O(n to the fourth power), with O(n squared) memory. This measure is marked costly and must be selected explicitly or through include.

Value

Named numeric vector in input node order.

References

Macker, J. P. (2016). An improved local bridging centrality model for distributed network analytics. MILCOM, pp. 600-605. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1109/MILCOM.2016.7795393")}.

Examples

centrality_extended_local_bridging(igraph::make_graph("Zachary"))

cograph documentation built on Sept. 30, 2026, 5:08 p.m.