On the Complexity and Dimension of Continuous Finite-Dimensional Maps

DOI10.1137/S0040585X97T990010zbMath1453.37022OpenAlexW3095306949MaRDI QIDQ5131238

Boris S. Darkhovsky

Publication date: 5 November 2020

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0040585x97t990010

zbMATH Keywords

continuous mapssegmentation of data\( \varepsilon \)-complexitymodel-free classification

Mathematics Subject Classification ID

Iteration of real functions in one variable (26A18) Dimension theory of smooth dynamical systems (37C45) Dynamical systems involving smooth mappings and diffeomorphisms (37C05)

Related Items

Estimate of the Hölder exponent based on the \(\epsilon\)-complexity of continuous functions ⋮ Estimating the Hölder exponents based on the \(\epsilon \)-complexity of continuous functions: an experimental analysis of the algorithm

Cites Work

• New approach to the segmentation problem for time series of arbitrary nature
• Approach to an irregular time series on the basis of the fractal theory
• On an approach to the estimation of the complexity of curves (using as an example an electroencephalogram of a Human being)
• Compression-Based Methods of Statistical Analysis and Prediction of Time Series
• Clustering by Compression
• Combinatorial foundations of information theory and the calculus of probabilities
• On convergence of uniform approximations of continuous functions
• Kolmogorov Complexity and Algorithmic Randomness
• Model‐free offline change‐point detection in multidimensional time series of arbitrary nature via ϵ‐complexity: Simulations and applications
• Stochastic Disorder Problems
• Elements of Information Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item