SearcharxivSearch

arXiv · 2104.03684

Stickiness in generic low-dimensional Hamiltonian systems: A recurrence-time statistics approach

Abstract

We analyze the structure and stickiness in the chaotic components of generic Hamiltonian systems with divided phase space. Following the method proposed recently in Lozej and Robnik [Phys. Rev. E 98, 022220 (2018)], the sticky regions are identified using the statistics of recurrence times of a single chaotic orbit into cells dividing the phase space into a grid. We perform extensive numerical studies of three example systems: the Chirikov standard map, the family of Robnik billiards, and the family of lemon billiards. The filling of the cells is compared to the random model of chaotic diffusion, introduced in Robnik et al. [J. Phys. A: Math. Gen. 30, L803 (1997)] for the description of transport in the phase spaces of ergodic systems. The model is based on the assumption of completely uncorrelated cell visits because of the strongly chaotic dynamics of the orbit and the distribution of recurrence times is exponential. In generic systems the stickiness induces correlations in the cell visits. The distribution of recurrence times exhibits a separation of timescales because of the dynamical trapping. We model the recurrence time distributions to cells inside sticky areas as a mixture of exponential distributions with different decay times. We introduce the variable S, which is the ratio between the standard deviation and the mean of the recurrence times as a measure of stickiness. We use S to globally assess the distributions of recurrence times. We find that in the bulk of the chaotic sea S=1, while S>1 in areas of stickiness. We present the results in the form of animated grayscale plots of the variable S in the largest chaotic component for the three example systems, included as supplemental material to this paper.

Explore related subjects

Keep this discovery

BibTeXRIS

Črt Lozej. 2021-04-08. Stickiness in generic low-dimensional Hamiltonian systems: A recurrence-time statistics approach. https://doi.org/10.1103/physreve.101.052204

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