info_signature: Compute the information signature

In allgebrist/algodyn: Algorithmic Information Dynamics

Description

Compute the information signature

Usage

info_signature(x, what, block_size = 4, offset = 4)

Arguments

x	an igraph object.
what	graph elements to be removed (i.e. edges or vertices).
block_size	block size required to estimate the Kolmogorov-Chaitin complexity of x using the 2-dimensional Block Decomposition Method (BDM).
offset	offset required to estimate the Kolmogorov-Chaitin complexity of x using the 2-dimensional Block Decomposition Method (BDM).

Details

The information signature σ(G) of graph G is the distribution of information values for either the edges or vertices of G, sorted decreasingly by information contribution. Information contributions above and below zero respectively correspond to elements whose removal makes the graph lose or gain information. Neutral elements are, on the other hand, those whose removal has no effect on the graph's information content. This function is simply a ranking of info_spectra.

Value

A data frame corresponding to the information signature of the input graph.

Examples

## Not run: 
# Compute the information signature of the Folkman graph
folkman <- make_graph("Folkman")
is <- info_signature(folkman)

## End(Not run)

allgebrist/algodyn documentation built on Oct. 21, 2019, 2:47 a.m.