Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.17905

Set-Oriented Approach to the Analysis of Chaotic Itinerancy

Wojciech Jaworek·Paweł Pilarczyk
View original source ↗Read source document ↗Export metadata ↓

Abstract

Chaotic itinerancy (CI), brought to attention, among others, by K. Ikeda, I. Tsuda and K. Kaneko in the early 1990s, is a phenomenon in which trajectories in a dynamical system experience periods of ordered motion near quasi-attractors interspersed with chaotic transitions between them. Possible maps in which CI was found include coupled map lattices (CML) and globally coupled one-dimensional chaotic maps (GCM). We study such maps using numerical methods and graph algorithms. Specifically, we partition the state space into a finite grid of compact subsets, and we represent the map using a multivalued mapping of grid elements. This mapping can be perceived as a directed graph, with grid elements as vertices and individual mappings between them as weighted edges. This setup provides a coarse view of global dynamics and opens the opportunity for using Markov chains and efficient graph algorithms to study dynamical features. In particular, invariant sets can be found by computing strongly connected components in the graph. Analysis of the transition matrix of the graph makes it possible to find its stationary distribution and to compute local entropy as a measure of expansion or instability in the system. Using these tools, we propose an algorithm for assessing whether a certain map possesses the CI property and show its application to dynamical systems: a globally coupled system of logistic maps and a variant of a CML system for which we conduct computations for a large range of parameters.

Explore related subjects

nlin.CDmath.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wojciech Jaworek, Paweł Pilarczyk. 2026-08-18. Set-Oriented Approach to the Analysis of Chaotic Itinerancy. https://arxiv.org/abs/2608.17905

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗