An entropy based measure for comparing distributions of complexity

DOI10.1016/J.PHYSA.2016.02.007MaRDI QIDQ1619478zbMATH OpenOpenAlexFDO

Authors R. Smith

Publication date 13 November 2018

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.physa.2016.02.007

zbMATH Keywords

Shannon entropycomplex systemsprobability distributionsmeasures of complexity

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• scientific article; zbMATH DE number 1114415
• A comparative classification of complexity measures
• Entropy measures vs. Kolmogorov complexity
• A kind of new information measure of complexity
• The Complexity of Approximating the Entropy
• Generalized statistical complexity measure
• Approximate entropy as a measure of system complexity.
• Entropy-based complexity measures for dynamic decision processes

Cites work

• A Complexity Measure
• Complexity. A guided tour
• Rényi entropy and complexity measure for skew-Gaussian distributions and related families
• Scale-free networks: a decade and beyond
• Statistical mechanics of complex networks

Cited in

(6)

• A statistical complexity measure with nonextensive entropy and quasi-multiplicativity
• Advancing Shannon entropy for measuring diversity in systems
• Monotone measures of statistical complexity
• GeoEntropy: a measure of complexity and similarity
• A novel method of visualizing \(q\)-complexity-entropy curve in the multiscale fashion
• Compression and diffusion: a joint approach to detect complexity.

This page was built for publication: An entropy based measure for comparing distributions of complexity

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