Abstract:Selecting a finite dictionary of observables whose span is Koopman-invariant is a central challenge in data-driven Koopman operator approximation. We address this problem by exploiting zero-block structure in Extended Dynamic Mode Decomposition (EDMD) matrices. We show that any sub-dictionary whose span is Koopman-invariant induces an exact zero block in the EDMD matrix, even for finite data. We then show that such blocks can be detected by applying PageRank to a row-normalized EDMD matrix constructed from a large initial dictionary. The theory extends to approximately invariant subspaces and yields stronger guarantees for personalized PageRank (PPR) when the seed observables lie inside the target block and reach all observables in that block. Combining EDMD concentration bounds with PageRank perturbation theory gives end-to-end detection guarantees with $O(1/\sqrt{M})$ finite-sample scaling and explicit constants. More generally, without assuming an invariant subspace exists, high PPR mass on a sub-dictionary controls discounted multi-step leakage from the seed observables. Numerical experiments on the Duffing oscillator, Van der Pol oscillator, Lorenz system, and a three-well Ramachandran potential suggest that the method identifies compact, interpretable dictionaries with accurate predictions.
| Comments: | 37 pages, 9 figures |
| Subjects: | Dynamical Systems (math.DS); Numerical Analysis (math.NA); Machine Learning (stat.ML) |
| MSC classes: | 37M21, 47B33, 05C82 |
| ACM classes: | G.1.7; I.2.8 |
| Cite as: | arXiv:2605.24666 [math.DS] |
| (or arXiv:2605.24666v1 [math.DS] for this version) | |
| https://doi.org/10.48550/arXiv.2605.24666 arXiv-issued DOI via DataCite (pending registration) |
From: Hyukpyo Hong [view email]
[v1]
Sat, 23 May 2026 17:09:02 UTC (16,081 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。