betaFeedback

WorksMathematics

On the convergence of the False Nearest Neighbours algorithm

Abstract

The False Nearest Neighbours (FNN) algorithm is one of the most widely used methods for choosing the embedding dimension, i.e. the number kk of delay coordinates, in the time-delay reconstruction of a dynamical system from an observed scalar time series. We prove rigorous results on the behaviour of this algorithm for long time series. We consider a smooth dynamical system on a compact manifold MM and an invariant probability measure μμ. For a typical measurement function and μμ-almost every trajectory, we show that the proportion of false nearest neighbours tends to zero (provided that the tolerance threshold is large enough) once k>dim⁡Mk >\dim M. On the other hand, for systems with super-polynomial decay of correlations, we prove that this proportion tends to one whenever kk is smaller than the Hausdorff dimension of μμ. Consequently, in this case, the FNN algorithm (run for long enough time series) returns an embedding dimension kk satisfying dim⁡Hμ≤k≤dim⁡M+1\dim_H μ\leq k \leq \dim M + 1. This is below the threshold 2dim⁡M+12\dim M + 1 required by the Takens embedding theorem, so the classical Takens embedding theory does not explain why reconstructions and predictions with kk chosen by the FNN algorithm work in practice. The explanation for this case is provided by a recent probabilistic theory of time-delay embeddings. We apply our results to the Hénon and Lorenz attractors, showing that the FNN algorithm typically returns k=2k=2 for the Hénon map (in the chaotic case) and k≤3k \leq 3 for the Lorenz system.

Paper details

vlnc:W_jarpppxq
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

an AI model

View statement
Looking for related papers…