A probabilistic Takens theorem

Krzysztof Barański, Yonatan Gutman, Adam Śpiewak

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

Let X ⊂ℝN be a Borel set, μ a Borel probability measure on X and T : X → X a locally Lipschitz and injective map. Fix k ∈ N strictly greater than the (Hausdorff) dimension of X and assume that the set of p-periodic points of T has dimension smaller than p for p = 1, ⋯, k - 1. We prove that for a typical polynomial perturbation h of a given locally Lipschitz function h:X ℝ, the k-delay coordinate map x (h(x), h (Tx),⋯, h (Tk-1 x) 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ölcskei, 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 coordinates from 2 dim X to dim 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.

Original languageEnglish
Pages (from-to)4940-4966
Number of pages27
JournalNonlinearity
Volume33
Issue number9
DOIs
StatePublished - Sep 2020
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2020 IOP Publishing Ltd & London Mathematical Society.

Keywords

  • Hausdorff Dimension
  • Takens delay embedding theorem
  • box-counting dimension
  • probabilistic embedding

Fingerprint

Dive into the research topics of 'A probabilistic Takens theorem'. Together they form a unique fingerprint.

Cite this