False neighbors and false strands: A reliable minimum embedding dimension algorithm
- 23 August 2002
- journal article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 66 (2), 026209
- https://doi.org/10.1103/physreve.66.026209
Abstract
The time-delay reconstruction of the state space of a system from observed scalar data requires a time lag and an integer embedding dimension. We demonstrate a reliable method to estimate the minimum necessary embedding dimension that improves upon previous methods by correcting for systematic effects due to temporal oversampling, autocorrelation, and changing time lag. The method gives a sharp and reliable indication of the proper dimension. With little computational cost, the method also distinguish easily between infinite-dimensional colored noise—including noisy periodicity—and low-dimensional dynamics.Keywords
This publication has 32 references indexed in Scilit:
- False-nearest-neighbors algorithm and noise-corrupted time seriesPhysical Review E, 1997
- Nonlinear-time-series analysis of chaotic laser dynamicsPhysical Review A, 1996
- State-space reconstruction using averaged scalar products of the dynamical system flow vectorsPhysical Review E, 1994
- Method to distinguish possible chaos from colored noise and to determine embedding parametersPhysical Review A, 1992
- Determining embedding dimension for phase-space reconstruction using a geometrical constructionPhysical Review A, 1992
- EmbedologyJournal of Statistical Physics, 1991
- Refinements to nearest-neighbor searching ink-dimensional treesAlgorithmica, 1991
- Optimal Embeddings of Chaotic Attractors from Topological ConsiderationsEurophysics Letters, 1991
- ERGODIC-THEORY OF CHAOS AND STRANGE ATTRACTORSReviews of Modern Physics, 1984
- Irregularity: a fundamental property of the atmosphereTellus A: Dynamic Meteorology and Oceanography, 1984