SearcharxivSearch

arXiv · 2111.12777

Asymptotic cycles in fractional maps of arbitrary positive orders

Abstract

Many natural and social systems possess power-law memory, and their mathematical modeling requires the application of discrete and continuous fractional calculus. Most of these systems are nonlinear and demonstrate regular and chaotic behavior, different from the behavior of memoryless systems. Finding periodic solutions is essential for understanding the regular and chaotic behavior of nonlinear systems. Fractional systems do not have periodic solutions except fixed points. Instead, they have asymptotically periodic solutions which, in the case of stable regular behavior, converge to the periodic sinks (similar to regular dissipative systems) and, in the case of unstable/chaotic behavior, act as repellers. In one of his recent papers, the first author derived equations that allow calculations of asymptotically periodic points for a wide class of discrete maps with memory. All fractional and fractional difference maps of the orders 0 < \alpha < 1 belong to this class. In this paper, we derive the equations that allow calculations of the coordinates of the asymptotically periodic points for a wider class of maps which include fractional and fractional difference maps of the arbitrary positive orders \alpha > 0. The maps are defined as convolutions of a generating function -G_K(x), which may be the same as in a corresponding regular map x_{n+1} = -G_K(x_n)+x_n, with a kernel U_{\alpha}(k), which defines the type of a map. In the case of fractional maps, it is U{\alpha}(k) = k^{\alpha}, and it is U{\alpha}(k) = k^{(\alpha)}, the falling factorial function, in the case of fractional difference maps. In this paper, we define the space of kernel functions that allow calculations of the periodic points of the corresponding maps with memory. We also prove that in fractional maps of the orders 1 < \alpha < 2 the total of all physical momenta of period-l points is zero.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mark Edelman, Avigayil B. Helman. 2021-11-24. Asymptotic cycles in fractional maps of arbitrary positive orders. https://doi.org/10.1007/s13540-021-00008-w

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