Measuring the Complexity of Continuous Distributions
Guillermo Santamar\'ia-Bonfil, Nelson Fern\'andez, Carlos Gershenson

TL;DR
This paper extends measures of complexity, emergence, and self-organization to continuous distributions using differential entropy, enabling the analysis of complex phenomena with known distributions like Gaussian and scale-free types.
Contribution
It introduces a method to quantify complexity in continuous distributions, linking it to information adaptation and broadening applicability.
Findings
Gaussian and scale-free distributions show high complexity values
Complexity measures relate to information adaptation
Method applicable to various continuous phenomena
Abstract
We extend previously proposed measures of complexity, emergence, and self-organization to continuous distributions using differential entropy. This allows us to calculate the complexity of phenomena for which distributions are known. We find that a broad range of common parameters found in Gaussian and scale-free distributions present high complexity values. We also explore the relationship between our measure of complexity and information adaptation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
