centrality_node_contraction: Node Contraction Centrality

View source: R/centrality-batch9.R

centrality_node_contractionR Documentation

Node Contraction Centrality

Description

Node contraction importance (Tan, Wu and Deng 2006, as restated by Wang et al. 2011) compares the agglomeration \partial(G) = 1 / (N \bar{L}) of a network, with \bar{L} the mean shortest-path length, before and after the node is merged with all its neighbors into one node:

IMC(v) = 1 - \frac{\partial(G)}{\partial(G_v)}.

The improved form adds the same score of the edges of the node computed on the line graph, IIMC(v) = \alpha\, IMC(v) + \beta \sum_{e \ni v} IMC_{L(G)}(e), with \alpha + \beta = 1.

Usage

centrality_node_contraction(x, ...)

centrality_node_contraction_improved(x, contraction_rho = 5, ...)

Arguments

x

Network input accepted by centrality.

...

Further arguments to centrality, such as normalized.

contraction_rho

Ratio \alpha / \beta for the improved form (default 5).

Details

The measure is computed on the simple undirected skeleton of the network, so direction, weights and loops are ignored. Higher values mark more important nodes. The sources assume a connected network. On a disconnected network the mean path length is taken over the mutually reachable ordered pairs. An isolated node scores 0, and a node whose contraction leaves no pair of mutually reachable nodes returns NaN. The Centrality Zoo describes the contracted graph as the graph with the node removed. The sources define it by contraction, which is implemented here.

Value

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

References

Tan, Y.-J., Wu, J., & Deng, H.-Z. (2006). Evaluation method for node importance based on node contraction in complex networks. Systems Engineering: Theory & Practice, 26(11), 79-83.

See Also

centrality_closeness_vitality, centrality.

Examples

centrality_node_contraction(regulation_net)
centrality_node_contraction_improved(regulation_net)

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