SearcharxivSearch

arXiv · 0805.4221

Ergodic Theory and Visualization I: Mesochronic Plots for Visualization of Ergodic Partition and Invariant Sets

Abstract

We present a computational study of a visualization method for invariant sets based on ergodic partition theory, first proposed in [1,2]. The algorithms for computation of the time averages of observables on phase space are developed and used to provide an approximation of the ergodic partition of the phase space. We term the graphical representation of this approximation - based on time averages of observables - a Mesochronic Plot (from Greek: \textit{meso} - mean, \textit{chronos} - time}. The method is useful for identifying low-dimensional projections (e.g. two-dimensional slices) of invariant structures in phase spaces of dimensionality bigger than two. We also introduce the concept of the ergodic quotient space, obtained by assigning a point to every ergodic set, and provide an embedding method whose graphical representation we call the Mesochronic Scatter Plot (MSP). We use the Chirikov standard map as a well-known and dynamically rich example in order to illustrate the implementation of our methods. In addition, we expose applications to other higher dimensional maps such as the Froéschle map for which we utilize our methods to analyze merging of resonances and, the three-dimensional Extended standard map for which we study the conjecture on its ergodicity [3]. We extend the study in our next paper [4] by investigating the visualization of periodic sets using harmonic time averages. Both of these methods are related to eigenspace structure of the Koopman operator.

Explore related subjects

Keep this discovery

BibTeXRIS

Zoran Levnajić, Igor Mezić. 2010-07-21. Ergodic Theory and Visualization I: Mesochronic Plots for Visualization of Ergodic Partition and Invariant Sets. https://doi.org/10.1063/1.3458896

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

KEEP EXPLORING

Related papers

Linear Response Predicts Cusp-Pair Births in Networks with a Localized Cubic

Linear response is cheap to measure; the bistability boundaries it organizes are not. For a passive network with one localized cubic, the driving-point receptance $G$ fixes the period-one cusp set at fundamental-harmonic order: cusps lie on a fixed phase contour of $G$, a tangency of that contour under parameter variation creates a pair, and its curvature separates a gap opening from an isolated loop. For a two-mode absorber the linear prediction locates a benchmark birth coupling to $0.3\%$, and to $0.03\%$ once a third-harmonic correction of scale $|G(3\Omega)/G(\Omega)|$ is included.

nlin.CD

Dynamics Creation through Neural Dynamical Transfer Learning

Data-driven machine learning has established a robust foundation for reconstructing nonlinear dynamical systems from observations, primarily for the purposes of forecasting and control. However, most existing efforts focus on recovering specific observed dynamics rather than the generative synthesis of new ones. Inspired by image fusion and style transfer, we introduce a neural network framework termed Neural Dynamical Transfer Learning (NDTL) to create new systems with prescribed dynamics from pairs of parent nonlinear dynamical systems. By computing fundamental dynamical signatures, including the intrinsic dimension, the Kaplan-Yorke dimension, the invariant measure statistics, and the Lyapunov spectrum, we demonstrate that NDTL preserves key features inherited from the parent models while simultaneously generating novel dynamics. Beyond these validation examples, NDTL induces a criterion for dynamics classification, creates stable oscillatory coexistence in the Hastings-Powell food chain model, produces interpretable epidemiological models, and provides a chaotic source for image encryption.

nlin.CD

The Spectral Skeleton of Chaos: Koopman Wave Packets on Poincar\'e Sections

A Poincar\'e section replaces a flow by a return map, but for a chaotic system this map is usually known only from sampled crossings. We show that coarse transport can be read directly from Koopman spectral data, without fitting the map. Measure-preserving EDMD retains the isometric structure; riggedDMD then approximates spectral measures and constructs finite regularized wave packets. Packet phase supplies a finite-resolution transport coordinate; low modulus marks a singular skeleton where the phase becomes ill-conditioned. We demonstrate the idea on the R\"ossler system, a 32-mode Kuramoto--Sivashinsky Galerkin system, and the forced Duffing oscillator. The packets yield coarse symbolic models on sections ranging from an almost one-dimensional curve to a visibly thick set. Their graphs organize observed low-period orbits and guide targeted searches for others. In Duffing Regime~II, a seven-region rule accounts for $91\%$--$94\%$ of filtered one-step transitions, while failures in the lowest retained modulus decile occur at $5.08$--$5.20$ times the overall rate. The packets are not Koopman eigenfunctions, nor are the regions exact Markov partitions. Together these computations show how spectral information beyond isolated eigenpairs can expose chaotic transport directly from trajectories.

nlin.CD