Estimating good discrete partitions from observed data: symbolic false nearest neighbors

Abstract

A symbolic analysis of observed time series data requires making a discrete partition of a continuous state space containing observations of the dynamics. A particular kind of partition, called ``generating'', preserves all dynamical information of a deterministic map in the symbolic representation, but such partitions are not obvious beyond one dimension, and existing methods to find them require significant knowledge of the dynamical evolution operator or the spectrum of unstable periodic orbits. We introduce a statistic and algorithm to refine empirical partitions for symbolic state reconstruction. This method optimizes an essential property of a generating partition: avoiding topological degeneracies. It requires only the observed time series and is sensible even in the presence of noise when no truly generating partition is possible. Because of its resemblance to a geometrical statistic frequently used for reconstructing valid time-delay embeddings, we call the algorithm ``symbolic false nearest neighbors''.

References in corpus (2)

• Validity of threshold-crossing analysis of symbolic dynamics from chaotic time series
• From template analysis to generating partitions I: Periodic orbits, knots and symbolic encodings

Cited by in corpus (14)

• Complex network approaches to nonlinear time series analysis
• Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems
• Complementarity in classical dynamical systems
• Quantifying the dynamical complexity of time series
• Bayesian Structural Inference for Hidden Processes
• Maximally predictive states: from partial observations to long timescales
• Entropy-based Generating Markov Partitions for Complex Systems
• Symbolic dynamics and synchronization of coupled map networks with multiple delays
• Embeddings of low-dimensional strange attractors: Topological invariants and degrees of freedom
• Implementing Turing Machines in Dynamic Field Architectures
• Symbolic partition in chaotic maps
• Prediction of flow dynamics using point processes
• Energy Prediction using Spatiotemporal Pattern Networks
• A Basic Framework for the Cryptanalysis of Digital Chaos-Based Cryptography