A probabilistic Takens theorem
Abstract
Let X ⊂ RN be a Borel set, μ a Borel probability measure on X and T:X X a Lipschitz and injective map. Fix k ∈ N greater than the (Hausdorff) dimension of X and assume that the set of p-periodic points has dimension smaller than p for p=1, …, k-1. We prove that for a typical polynomial perturbation h of a given Lipschitz map h : X R, the k-delay coordinate map x (h(x), h(Tx), …, h(Tk-1x)) is injective on a set of full measure μ. This is a probabilistic version of the Takens delay embedding theorem as proven by Sauer, Yorke and Casdagli. We also provide a non-dynamical probabilistic embedding theorem of similar type, which strengthens a previous result by Alberti, B\"olcskei, De Lellis, Koliander and Riegler. In both cases, the key improvements compared to the non-probabilistic counterparts are the reduction of the number of required measurements from 2 X to X and using Hausdorff dimension instead of the box-counting one. We present examples showing how the use of the Hausdorff dimension improves the previously obtained results.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.