Search arXivSearch

arXiv · 2512.20247

Koopman for stochastic dynamics: error bounds for kernel extended dynamic mode decomposition

Abstract

We prove $L^\infty$-error bounds for kernel extended dynamic mode decomposition (kEDMD) approximants of the Koopman operator for stochastic dynamical systems. To this end, we establish Koopman invariance of suitably chosen reproducing kernel Hilbert spaces and provide an in-depth analysis of the pointwise error in terms of the data points. The latter is split into two parts by showing that kEDMD for stochastic systems involves a kernel regression step leading to a deterministic error in the fill distance as well as Monte Carlo sampling to approximate unknown expected values yielding a probabilistic error in terms of the number of samples. We illustrate the derived bounds by means of Langevin-type stochastic differential equations involving a nonlinear double-well potential.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maximiliano Hertel, Friedrich M. Philipp, Manuel Schaller, Karl Worthmann. 2026-04-17. Koopman for stochastic dynamics: error bounds for kernel extended dynamic mode decomposition. https://arxiv.org/abs/2512.20247

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS