Maximum Neighborhood Component

The maximum neighborhood component (Lin et al. 2008) is the number of nodes in the largest connected component of the subgraph induced by the neighbors of a node.

Usage

centrality_mnc(x, mode = "all", ...)

Arguments

x: Network input accepted by centrality.
mode: Direction for directed networks: "all" (default), "out" or "in".
...: Further arguments to centrality.

Value

A named integer vector with one size per node, in input node order.

Details

Edge weights are ignored and the neighbor subgraph is read as undirected. mode selects the neighbors. An isolated node scores 0. On undirected networks the values equal centiserve::mnc().

References

Lin, C.-Y., Chin, C.-H., Wu, H.-H., Chen, S.-H., Ho, C.-W., & Ko, M.-T. (2008). Hubba: hub objects analyzer, a framework of interactome hubs identification for network biology. Nucleic Acids Research, 36, W438-W443. doi:10.1093/nar/gkn257 .

Examples

centrality_mnc(regulation_net)
#>    Explore       Plan    Monitor      Adapt    Reflect    Discuss Synthesize 
#>          5          6          7          6          3          5          4 
#>   Evaluate     Create      Share 
#>          5          6          5