getSubnetworksEigenadjacent: Extract subnetworks using Eigen centrality scores of nodes

In cds-group/GraphDistances: Distribution based distance computation between graphs

Description

A subnetwork is extracted by choosing top eigen central nodes (based on the supplied cut-off) and also the nodes adjacent to them.

Usage

getSubnetworksEigenadjacent(g, eigenSortcutoff = 0.1, percentTotalnodes = NA)

Arguments

g	graph in igraph format
eigenSortcutoff	cutoff based on eigen centrality score (values >0 and <1) - default = 0.1
percentTotalnodes	cutoff based on percentage of top eigen central ranked nodes to be selected

Value

subnetwork

Examples

## Not run: 
data(KidneyGraphs)
g <- KidneyGraphs[[1]]
getSubnetworksEigenadjacent(g, eigenSortcutoff = 0.1)
## End(Not run)

cds-group/GraphDistances documentation built on Dec. 14, 2020, 8:26 a.m.