Toward automated extraction and characterization of scaling regions in dynamical systems.

Scaling regions-intervals on a graph where the dependent variable depends linearly on the independent variable-abound in dynamical systems, notably in calculations of invariants like the correlation dimension or a Lyapunov exponent. In these applications, scaling regions are generally selected by hand, a process that is subjective and often challenging due to noise, algorithmic effects, and confirmation bias. In this paper, we propose an automated technique for extracting and characterizing such regions. Starting with a two-dimensional plot-e.g., the values of the correlation integral, calculated using the Grassberger-Procaccia algorithm over a range of scales-we create an ensemble of intervals by considering all possible combinations of end points, generating a distribution of slopes from least squares fits weighted by the length of the fitting line and the inverse square of the fit error. The mode of this distribution gives an estimate of the slope of the scaling region (if it exists). The end points of the intervals that correspond to the mode provide an estimate for the extent of that region. When there is no scaling region, the distributions will be wide and the resulting error estimates for the slope will be large. We demonstrate this method for computations of dimension and Lyapunov exponent for several dynamical systems and show that it can be useful in selecting values for the parameters in time-delay reconstructions.

[1]  J. Meiss,et al.  Using curvature to select the time lag for delay reconstruction. , 2020, Chaos.

[2]  Full Width at Half Maximum , 2020, Definitions.

[3]  Johannes L. Schönberger,et al.  SciPy 1.0: fundamental algorithms for scientific computing in Python , 2019, Nature Methods.

[4]  Xingyuan Wang,et al.  Identifying the linear region based on machine learning to calculate the largest Lyapunov exponent from chaotic time series. , 2018, Chaos.

[5]  Z. Shuang,et al.  A novel method based on the fuzzy C-means clustering to calculate the maximal Lyapunov exponent from small data , 2016 .

[6]  Elizabeth Bradley,et al.  Nonlinear time-series analysis revisited. , 2015, Chaos.

[7]  Joshua Garland,et al.  Prediction in projection. , 2015, Chaos.

[8]  D. Plenz,et al.  powerlaw: A Python Package for Analysis of Heavy-Tailed Distributions , 2013, PloS one.

[9]  Hua Zhu,et al.  A novel method to identify the scaling region for chaotic time series correlation dimension calculation , 2011 .

[10]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[11]  Divakar Viswanath,et al.  The fractal property of the Lorenz attractor , 2004 .

[12]  H. Peitgen,et al.  Chaos and Fractals , 2004 .

[13]  Holger Kantz,et al.  Practical implementation of nonlinear time series methods: The TISEAN package. , 1998, Chaos.

[14]  D. Kugiumtzis.  State space reconstruction parameters in the analysis of chaotic time series—the role of the time window length , 1996, comp-gas/9602002.

[15]  M. Rosenstein,et al.  Reconstruction expansion as a geometry-based framework for choosing proper delay times , 1994 .

[16]  H. Kantz.  A robust method to estimate the maximal Lyapunov exponent of a time series , 1994 .

[17]  Mingzhou Ding,et al.  Estimating correlation dimension from a chaotic time series: when does plateau onset occur? , 1993 .

[18]  Martin Casdagli,et al.  An analytic approach to practical state space reconstruction , 1992 .

[19]  K. Pawelzik,et al.  Optimal Embeddings of Chaotic Attractors from Topological Considerations , 1991 .

[20]  H. Schuster,et al.  Proper choice of the time delay for the analysis of chaotic time series , 1989 .

[21]  P. Grassberger,et al.  Measuring the Strangeness of Strange Attractors , 1983 .

[22]  D. W. Scott.  On optimal and data based histograms , 1979 .

[23]  S. S. Vallender.  Calculation of the Wasserstein Distance Between Probability Distributions on the Line , 1974 .

[24]  Y. Wong,et al.  Differentiable Manifolds , 2009 .