MPR_complexity: A function to compute the MPR-complexity

Description Usage Arguments Details Value Author(s) References Examples

View source: R/complexity_measures.R

Description

The function computes the MPR complexity, i.e. a generalized (global) complexity measure based on the Jenson-Shannon divergence.

Usage

1

Arguments

opd

A numeric vector that details an ordinal pattern distribution.

Details

Generalized complexity measures combine an information measure (i.e. entropy) with the distance of the distribution from the uniform distribution ("disequilibrium"). As a global measure, MPR-complexity is insensitive to the permutation coding scheme.

Value

The normalized MPR complexity measure in the range [0, 1].

Author(s)

Sebastian Sippel

References

Martin, M.T., Plastino, A. and Rosso, O.A., 2006. Generalized statistical complexity measures: Geometrical and analytical properties. Physica A: Statistical Mechanics and its Applications, 369(2), pp.439-462.

Examples

1
2
3
x = arima.sim(model=list(ar = 0.3), n = 10^4)
opd = ordinal_pattern_distribution(x = x, ndemb = 6)
MPR_complexity(opd)


statcomp documentation built on May 19, 2017, 3:40 p.m.
Search within the statcomp package
Search all R packages, documentation and source code

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs in the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.