number.differences: Calculates the differences with respect to the number of...

In RomanSchefzik/DNT: Differential network tests

Calculates the differences with respect to the number of edges, clusters and isolated nodes between two networks

Description

This function calculates the differences with respect to the number of edges, clusters (obtained by the Girvan-Newman algorithm) and isolated nodes (i.e. nodes without any edge) between two networks, for both igraph graphs and the corresponding minimum spanning trees (MSTs).

Usage

number.differences(A, B)

Arguments

A, B	output results when applying the function create.graph to two data tables from which the two networks are constructed

Details

This function calculates the differences with respect to the number of edges, clusters (obtained by the Girvan-Newman algorithm) and isolated nodes (i.e. nodes without any edge) between two networks, for both igraph graphs and the corresponding minimum spanning trees (MSTs). It builds on the create.graph function, which creates igraph graph and corresponding MST results from adjacency matrices that are produced out of input tables, using an estimation method specified by the user; see the documentation of create.graph for further information. Differences in numbers of edges, clusters and isolated nodes are overall characteristics that can be employed to compare two networks.

Value

a vector of length 6 containing the graph difference in the number of edges, the graph difference in the number of clusters, the graph difference in the number of isolated nodes, the MST difference in the number of edges, the MST difference in the number of clusters and the MST difference in the number of isolated nodes

Examples

A<-create.graph(ExDataA,methodlist=list("Spearman"))
B<-create.graph(ExDataB,methodlist=list("Spearman"))
number.differences(A,B)

RomanSchefzik/DNT documentation built on Sept. 11, 2022, 10:29 p.m.