inforank: Algorithmic Information Ranking (InfoRank)

In allgebrist/algodyn: Algorithmic Information Dynamics

Description

Algorithmic Information Ranking (InfoRank)

Usage

inforank(x, block_size, offset, base, what)

Arguments

x	string, igraph object or valid adjacency matrix.
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).
base	number of distinct characters in x when x is a string.
what	graph elements to be removed (i.e. edges or vertices).

Details

This function produces a ranking of the input graph's edges from least informative to most informative edge, i.e. a list of edges sorted in increasing order by their information contribution to the graph.

Value

A data frame corresponding to a ranking of the elements of the input object according to their information contribution.

Examples

## Not run: 
# For strings
inforank("ababbab", base = 2)
# For graphs
g <- make_graph("Smallestcyclicgroup")
inforank(g, what = 'edges')

## End(Not run)

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