Optimal Markov Approximations and Generalized Embeddings

Abstract

Based on information theory, we present a method to determine an optimal Markov approximation for modelling and prediction from time series data. The method finds a balance between minimal modelling errors by taking as much as possible memory into account and minimal statistical errors by working in embedding spaces of rather small dimension. A key ingredient is an estimate of the statistical error of entropy estimates. The method is illustrated with several examples and the consequences for prediction are evaluated by means of the root mean squard prediction error for point prediction.

12 pages, 6 figures

References in corpus (2)

• A Unified Approach to Attractor Reconstruction
• Nearest neighbor embedding with different time delays

Cited by in corpus (6)

• Nonlinear time-series analysis revisited
• Trends in recurrence analysis of dynamical systems
• A unified and automated approach to attractor reconstruction
• Optimal reconstruction of dynamical systems: A noise amplification approach
• Entropy-based Generating Markov Partitions for Complex Systems
• Model-free measure of coupling from embedding principle