sdnet (version 2.4.1)

cnComplexity-method: Network Complexity

Description

Returns the complexity of a network

Usage

cnComplexity(object, node=NULL, include.unif=TRUE)
cnKLComplexity(object, node=NULL)

Arguments

object

a catNetwork object

node

an integer, node index

include.unif

a logical

Value

An integer

Details

Complexity is a network characteristics that depends both on its graphical structure and the categorization of its nodes.

If node is specified, then the function returns that node complexity, otherwise the total complexity of object, which is the sum of its node complexities, is reported. A node complexity is determined by the number of its parents and their categories. For example, a node without parents has complexity 1. A node with k parents with respected number of categories c1,c2, ...,ck, has complexity c1*c2*...*ck. Complexity is always a number that is equal or greater than the number of nodes in the network. For a network with specified graph structure, its complexity determines the number of parameters needed to define its probability distribution and hence the importance of complexity as network characteristic.

If include.unif is set to FALSE

Examples

# NOT RUN {
  cnet <- cnRandomCatnet(numnodes=10, maxpars=3, numcats=2)
  cnComplexity(object=cnet)
# }