Measuring chaos in the Lorenz and Rössler models: Fidelity tests for reservoir computing

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Scully, James, Neiman, Alexander, Shilnikov, Andrey
Natura: Preprint
Pubblicazione: 2021
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866917697308065792
author Scully, James
Neiman, Alexander
Shilnikov, Andrey
author_facet Scully, James
Neiman, Alexander
Shilnikov, Andrey
contents This study is focused on the qualitative and quantitative characterization of chaotic systems with the use of symbolic description. We consider two famous systems: Lorenz and Rössler models with their iconic attractors, and demonstrate that with adequately chosen symbolic partition three measures of complexity, such as the Shannon source entropy, the Lempel-Ziv complexity and the Markov transition matrix, work remarkably well for characterizing the degree of chaoticity, and precise detecting stability windows in the parameter space. The second message of this study is to showcase the utility of symbolic dynamics with the introduction of a fidelity test for reservoir computing for simulating the properties of the chaos in both models' replicas. The results of these measures are validated by the comparison approach based on one-dimensional return maps and the complexity measures.
format Preprint
id arxiv_https___arxiv_org_abs_2108_10691
institution arXiv
publishDate 2021
record_format arxiv
spellingShingle Measuring chaos in the Lorenz and Rössler models: Fidelity tests for reservoir computing
Scully, James
Neiman, Alexander
Shilnikov, Andrey
Dynamical Systems
Chaotic Dynamics
This study is focused on the qualitative and quantitative characterization of chaotic systems with the use of symbolic description. We consider two famous systems: Lorenz and Rössler models with their iconic attractors, and demonstrate that with adequately chosen symbolic partition three measures of complexity, such as the Shannon source entropy, the Lempel-Ziv complexity and the Markov transition matrix, work remarkably well for characterizing the degree of chaoticity, and precise detecting stability windows in the parameter space. The second message of this study is to showcase the utility of symbolic dynamics with the introduction of a fidelity test for reservoir computing for simulating the properties of the chaos in both models' replicas. The results of these measures are validated by the comparison approach based on one-dimensional return maps and the complexity measures.
title Measuring chaos in the Lorenz and Rössler models: Fidelity tests for reservoir computing
topic Dynamical Systems
Chaotic Dynamics
url https://arxiv.org/abs/2108.10691