mnc {centiserve}R Documentation

Find the maximum neighborhood component (MNC)

Description

Maximum Neighborhood Component defined as:

MNC(v)=|V(MC(v))|

where where MC(v) is a maximum connected component of the G[N(v)] and G[N(v)] is the induced subgraph of G by N(v) and N(v) is neighborhoods of node v.

Usage

mnc(graph, vids = V(graph), mode = c("all", "out", "in"))

Arguments

graph

The input graph as igraph object

vids

Vertex sequence, the vertices for which the centrality values are returned. Default is all vertices.

mode

Character constatnt, it specifies how to use the direction of the edges if a directed graph is analyzed. For 'out' only the outgoing edges are followed. For 'in' all vertices from which the source vertex is reachable in at most order steps are counted. 'all' ignores the direction of the edges. This argument is ignored for undirected graphs.

Details

The neighborhood of a node v, nodes adjacent to v, induce a subnetwork N(v). The score of node v, MNC(v), is defined to be the size of the maximum connected component of N(v). The neighborhood N(v) is the set of nodes adjacent to v and does not contain node v.
More detail at MNC-Maximum Neighborhood Component

Value

A numeric vector contaning the centrality scores for the selected vertices.

Author(s)

Mahdi Jalili m_jalili@farabi.tums.ac.ir

References

Lin, Chung-Yen, et al. "Hubba: hub objects analyzer-a framework of interactome hubs identification for network biology." Nucleic acids research 36.suppl 2 (2008): W438-W443.

Examples

g <- random.graph.game(20, 3/10)
mnc(g)

[Package centiserve version 1.0.0 Index]