Complexity Analysis of Chaos and Other Fluctuating Phenomena
Jamieson Brechtl, Xie Xie, Karen A. Dahmen, Peter K. Liaw

TL;DR
This paper uses a multiscale-entropy algorithm to analyze the complexity of various fluctuating phenomena like Weierstrass functions, colored noise, and Logistic maps, revealing how their irregularities relate to underlying parameters.
Contribution
It applies a refined entropy method to different complex systems, providing new insights into how their complexity varies with parameters and bifurcations.
Findings
Complexity increases with fractional dimension D in Weierstrass functions.
Maximum fluctuation complexity occurs at 1/f noise among colored noises.
Complexity maps of Logistic map correlate with bifurcation diagrams.
Abstract
The refined composite multiscale-entropy algorithm was applied to the time-dependent behavior of the Weierstrass functions, colored noise, and Logistic map to provide fresh insight into the dynamics of these fluctuating phenomena. For the Weierstrass function, the complexity of fluctuations was found to increase with respect to the fractional dimension, D, of the graph. Additionally, the sample-entropy curves increased in an exponential fashion with increasing D. This increase in the complexity was found to correspond to a rising amount of irregularities in the oscillations. In terms of the colored noise, the complexity of the fluctuations was found to be highest for the 1/f noise (f is the frequency of the generated noise), which is in agreement with findings in the literature. Moreover, the sample-entropy curves exhibited a decreasing trend for noise when the spectral exponent, \beta,…
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.
