Arrangement, a Measure of Nonrandom Complexity

DOI10.1080/02329290290031071zbMATH Open1233.62005OpenAlexW2033155185MaRDI QIDQ4809974FDOQ4809974

Authors: Hector C. Sabelli 

Publication date: 31 August 2004

Published in: Systems Analysis Modelling Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02329290290031071

Recommendations

• A complexity score derived from principal components analysis of nonlinear order measures
• HIGHER ORDER COMPLEXITY OF TIME SERIES
• Approximate entropy as a measure of system complexity.
• A measure of stochastic complexity and its power in testing for randomness.
• Characterizing complexity of dynamical systems.

Mathematics Subject Classification ID

Foundational topics in statistics (62A99) Foundations of probability theory (60A99)

Cited In (3)

• A complexity score derived from principal components analysis of nonlinear order measures
• Novelty, diversification and nonrandom complexity define creative processes
• Mathematical foundation of a new complexity measure

This page was built for publication: Arrangement, a Measure of Nonrandom Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809974)