dmnc: Find the density of maximum neighborhood component (DMNC) in a graph
Description
The score of node \(v\), \(DMNC(v)\), is defined to be \(\frac{E}{N^{\epsilon}}\):
$$\frac{\left|E(MNC(v))\right|}{\left|V(MNC(v))\right|^{\epsilon}}$$
where for some \(1 \leq \epsilon \leq 2\).
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.
epsilon
\(\epsilon\) parameter which default is 1.67.
Value
A numeric vector contaning the centrality scores for the selected vertices.