Searcharxiv⌕ Search

arXiv · 2611.18087

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 $k$ 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 $M$ 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 M$. On the other hand, for systems with super-polynomial decay of correlations, we prove that this proportion tends to one whenever $k$ is smaller than the Hausdorff dimension of $μ$. Consequently, in this case, the FNN algorithm (run for long enough time series) returns an embedding dimension $k$ satisfying $\dim_H μ\leq k \leq \dim M + 1$. This is below the threshold $2\dim M + 1$ required by the Takens embedding theorem, so the classical Takens embedding theory does not explain why reconstructions and predictions with $k$ 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=2$ for the Hénon map (in the chaotic case) and $k \leq 3$ for the Lorenz system.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adam Śpiewak. 2026-11-13. On the convergence of the False Nearest Neighbours algorithm. https://searcharxiv.com/abs/2611.18087

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Scattering in the planar restricted $(N+1)$-body problem

In the restricted $(N+1)$-body problem, as time goes to positive or negative infinity the massless body has four possible final motions: hyperbolic, parabolic, oscillatory and bounded. In the hyperbolic case, the massless body comes from or goes to infinity with a non-zero limiting energy and a limiting direction, and in the parabolic case, it comes from or goes to infinity with a zero limiting energy and possibly a limiting direction. In this paper we study scattering orbits that come from infinity and then go to infinity. It will be proven that for the planar restricted $(N+1)$-body problem with the motions of the primaries being collision-free and periodic, for any two given asymptotic directions, there exists at least one hyperbolic scattering orbit for any positive limiting energy and one parabolic scattering orbit. The orbits are either always collision-free or regularizable with one collision.

math.DS↗

Exponential mixing for equilibrium states of time changes of hyperbolic geodesic flows

Let $M$ be a closed hyperbolic manifold of dimension $n\ge2$, let $ψ$ be a smooth positive function on its unit tangent bundle $SM$, and let $f^t_ψ$ be the time change of the geodesic flow with speed $1/ψ$. We prove that $f^t_ψ$ is exponentially mixing, for Hölder observables, with respect to the equilibrium state of every Hölder potential, as asked by Bowen and Ruelle. This includes the smooth invariant measure and the measure of maximal entropy. The proof runs Dolgopyat's cancellation argument at a variable \emph{local frequency} $Λ_b=|b|(1+\|\bY_b\|)$ (Proposition~\ref{prop:localfreq}): the scale $1/|b|$ is replaced by a scale that depends on the point, as in the work of Tsujii and Zhang in dimension three, and the argument runs without a smooth contact structure and without $C^1$ strong foliations. Many of the techniques, in particular the reduction to an expanding semiflow by quotienting along the stable foliation, are inspired by the earlier work of Butterley and War \cite{BW20}.

math.DS↗

Structural functional identifiability of unknown differential equation observation maps

In many differential equation models of real-world systems, the mechanistic structure of the dynamics is known, but the map from the dynamics to the observations is not. This is potentially problematic, as it can prevent us from e.g. learning model parameter values from data. Examples where this occurs include measuring a fluorescent marker as a proxy for the dynamics of a cellular circuit, and using wastewater measurements to follow the development of an epidemic. The nascent field of hybrid modelling, in which machine learning components (like neural networks) are embedded within mechanistic models, provides the tools to learn such maps. Here, the system's dynamics keep their mechanistic form, while a neural network represents the unknown observation map and is trained alongside any unknown core system parameters. This raises a question of identifiability: when can the true observation map be learnt, and when does one simply learn some map that transforms the dynamics into the available data? Building on previous work, we show how structural functional identifiability analysis can establish whether a model's unknown observation maps and core system parameters are identifiable, i.e. can be uniquely learnt from data. We both prove general results on when models with unknown observation maps are, and are not, identifiable, and demonstrate a general methodology (based on differential algebra) for assessing the identifiability of such models. This paves the way for applying classic differential equation workflows to the many real-world systems that contain such unknown maps.

math.DS↗