Papers › Testing topological conjugacy of time series
Testing topological conjugacy of time series
Paweł Dłotko, Michał Lipiński, Justyna Signerska-Rynkowska
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper considers a problem of testing, from a finite sample, a topological conjugacy of two dynamical systems (X,f) and (Y,g). More precisely, given x₁,…, xₙ ⊂X and y₁,…,yₙ ⊂Y such that xᵢ₊₁ = f(xᵢ) and yᵢ₊₁ = g(yᵢ) as well as h: X →Y, we deliver a number of tests to check if f and g are topologically conjugated via h. The values of the tests are close to zero for conjugated systems and large for systems that are not conjugated. Convergence of the test values, in case when sample size goes to infinity, is established. A number of numerical examples indicating scalability and robustness of the methods are given. In addition, we show how the presented method specialize to a test of sufficient embedding dimension in Takens' embedding theorem. Our methods also apply to the situation when we are given two observables of deterministic processes, of a form of one or higher dimensional time-series. In this case, their similarity can be accessed by comparing the dynamics of their Takens' reconstructions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections