Reconstructing dynamical systems as zero-noise limits
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910594515337216 |
|---|---|
| author | Das, Suddhasattwa |
| author_facet | Das, Suddhasattwa |
| contents | A dynamical system may be defined by a simple transition law - such as a map or a vector field. The objective of most learning techniques is to reconstruct this dynamic transition law. This is a major shortcoming, as most dynamic properties of interest are asymptotic properties such as an attractor or invariant measure. Thus approximating the dynamical law may not be sufficient to approximate these asymptotic properties. This article presents a method of representing a discrete-time deterministic dynamical system as the zero-noise limit of a Markov process. The Markov process approximation is completely data-driven. Besides proving a low-noise approximation of the dynamics the process also approximates the invariant set, via the support of its stationary measures. Thus invariant sets of arbitrary dynamical systems, even with complicated non-smooth topology, can be approximated by this technique. Under further assumptions, we show that the technique performs a convergent statistical approximation as well as approximations of true orbits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_16673 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Reconstructing dynamical systems as zero-noise limits Das, Suddhasattwa Dynamical Systems Probability 52A27, 37M99, 37M22, 7B02, 37M10, 37B10 A dynamical system may be defined by a simple transition law - such as a map or a vector field. The objective of most learning techniques is to reconstruct this dynamic transition law. This is a major shortcoming, as most dynamic properties of interest are asymptotic properties such as an attractor or invariant measure. Thus approximating the dynamical law may not be sufficient to approximate these asymptotic properties. This article presents a method of representing a discrete-time deterministic dynamical system as the zero-noise limit of a Markov process. The Markov process approximation is completely data-driven. Besides proving a low-noise approximation of the dynamics the process also approximates the invariant set, via the support of its stationary measures. Thus invariant sets of arbitrary dynamical systems, even with complicated non-smooth topology, can be approximated by this technique. Under further assumptions, we show that the technique performs a convergent statistical approximation as well as approximations of true orbits. |
| title | Reconstructing dynamical systems as zero-noise limits |
| topic | Dynamical Systems Probability 52A27, 37M99, 37M22, 7B02, 37M10, 37B10 |
| url | https://arxiv.org/abs/2407.16673 |