View source: R/centrality-batch9.R
| centrality_node_contraction | R Documentation |
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.
centrality_node_contraction(x, ...)
centrality_node_contraction_improved(x, contraction_rho = 5, ...)
x |
Network input accepted by |
... |
Further arguments to |
contraction_rho |
Ratio |
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.
A named numeric vector with one score per node, in input node order.
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.
centrality_closeness_vitality,
centrality.
centrality_node_contraction(regulation_net)
centrality_node_contraction_improved(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.