Persistence of Morse decompositions over grid resolution for maps and time series (Q2151733): Difference between revisions

Given a continuous map \(f:X\rightarrow X\) on a compact metric space \(X\), an approach to study the dynamics associated with \(f\) is to consider a discretization of \(X\) and to computationally build a multivalued map \(\mathcal{F}\) on the discretization approaching \(f\). The map \(\mathcal{F}\) can be generated directly from \(f\) or a time series. In this setting, a natural question that arises is about the relation between the dynamics of \(f\) and the dynamics of \(\mathcal{F}\). The space \(X\) can be discretized using a grid \(\mathcal{G}\) and the behavior of the map \(\mathcal{F}: \mathcal{G} \rightrightarrows \mathcal{G}\) depends on the resolution of the grid. In order to study the dependence of the dynamics on the grid resolution one can use persistence. In the paper under review, the author studies the persistence of Morse decompositions over grids looking at the individual Morse sets as well as at the connections between them. More specifically, given a collection of grids \(\{\mathcal{G}_{k}\}\) for \(X\), partially ordered by refinement, with maps \(\mathcal{F}_k: \mathcal{G}_k \rightrightarrows \mathcal{G}_k\), the author proves that the persistence for grid maps induces persistence for the corresponding Morse decompositions. The author considers several notions of persistence, such as graph structure, persistent homology, and mixing properties, to study the persistence of Morse decompositions at both the global (Morse graph) and local (individual Morse set) levels.