From metastable to coherent sets- Time-discretization schemes

• Published in: Chaos (Woodbury, N.Y.) Vol. 29; no. 1; p. 012101
• Main Authors: Fackeldey, Konstantin, Koltai, Péter, Névir, Peter, Rust, Henning, Schild, Axel, Weber, Marcus
• Format: Journal Article
• Language: English
• Published: United States 01.01.2019
• ISSN: 1089-7682
• DOI: 10.1063/1.5058128

Given a time-dependent stochastic process with trajectories x(t) in a space Ω, there may be sets such that the corresponding trajectories only very rarely cross the boundaries of these sets. We can analyze such a process in terms of metastability or coherence. Metastable setsM are defined in space M⊂Ω, and coherent setsM(t)⊂Ω are defined in space and time. Hence, if we extend the space Ω by the time-variable t, coherent sets are metastable sets in Ω×[0,∞) of an appropriate space-time process. This relation can be exploited, because there already exist spectral algorithms for the identification of metastable sets. In this article, we show that these well-established spectral algorithms (like PCCA+, Perron Cluster Cluster Analysis) also identify coherent sets of non-autonomous dynamical systems. For the identification of coherent sets, one has to compute a discretization (a matrix T) of the transfer operator of the process using a space-time-discretization scheme. The article gives an overview about different time-discretization schemes and shows their applicability in two different fields of application.