SearcharxivSearch

arXiv subjects

David Hien

Publications and source records attributed to David Hien.

3 recordsLinked to original sources

Distance Matrices of Ordered Point Clouds and Their Persistent Homology

The distance matrix of a finite point cloud can be visualized as a heatmap. When the data arise from a time series, the sublevel sets of this image are known as recurrence plots and are widely used in time series analysis. Motivated by this perspective, we establish a relationship between the distance-matrix filtration of the time series and the \v{C}ech (or Vietoris--Rips) filtration of its state-space embedding in the form of a degree-one chain map. We study the induced maps in homology, showing that the map from $H_0$ into $H_1$ is essentially surjective and providing an example where the map from $H_1$ into $H_2$ is nontrivial. These chain maps can be applied to simplify image persistence computations arising in the computation of cycling signatures, a topological tool for time series analysis. Moreover, these computations yield finer information that allows the analysis of transitions between different types of cycling motion.

math.AT

Cycling Signatures: Identifying Cycling Motions in Time Series using Algebraic Topology

Recurrence is a fundamental characteristic of dynamical systems with complicated behavior. Understanding the inner structure of recurrence is challenging, especially if the system has many degrees of freedom and is subject to noise. We develop algebraic topological notions for identifying and classifying elementary recurrent motions -- called cycling -- and the transitions between those. Statistics on these cycling motions can be computed from sampled trajectories (time series data), providing coarse global information on the structure of the recurrent behavior. We demonstrate this through three examples; in particular, we identify and analyze six cycling motions in a four dimensional system with a hyperchaotic attractor. We see this as a promising approach to reveal coarse-grained dynamical information on high-dimensional systems.

math.DS

Combinatorial models of global dynamics: learning cycling motion from data

We describe a computational method for constructing a coarse combinatorial model of some dynamical system in which the macroscopic states are given by elementary cycling motions of the system. Our method is in particular applicable to time series data. We illustrate the construction by a perturbed double well Hamiltonian as well as the Lorenz system.

math.DS