A function to compute the MPR-complexity
The function computes the MPR complexity, i.e. a generalized (global) complexity measure based on the Jenson-Shannon divergence.
A numeric vector that details an ordinal pattern distribution.
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.
The normalized MPR complexity measure in the range [0, 1].
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.
1 2 3
Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.