Random Pullback Attractors and Numerical Approximation for Nonlocal Lattice Delay Equations Driven by Rough Noise

Lijuan Zhang; Jiangwei Zhang; Jianhua Huang

Home/Archive/arXiv

arXiv · 2610.07076

Random Pullback Attractors and Numerical Approximation for Nonlocal Lattice Delay Equations Driven by Rough Noise

Lijuan Zhang·Jiangwei Zhang·Jianhua Huang

View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate the pathwise asymptotic dynamics of a nonlocal lattice equation with fixed delay on $\ell^2(\mathbb Z)$ driven by an infinite-dimensional stationary weakly geometric rough path. Using a rough-flow Doss-Sussmann transformation and the method of steps, we establish global well-posedness in the controlled-path framework and construct a continuous random dynamical system. We further construct a tempered pullback absorbing family and use a spatially localized Lyapunov-Krasovskii functional, together with a sewing estimate for the spatial tails of the driving rough path, to prove that the lattice tails vanish uniformly. The existence of a unique random pullback attractor is then established by combining this lattice-tail estimate with an Arzelà--Ascoli compactness argument. Finally, for the delay-compatible compensated Euler schemes and finite-dimensional lattice truncations, we establish uniform absorbing and lattice-tail estimates, which yield the existence of the approximate random pullback attractors and their joint upper semicontinuity, without a coupling condition between the time step and the spatial truncation level.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Lijuan Zhang, Jiangwei Zhang, Jianhua Huang. 2026-10-05. Random Pullback Attractors and Numerical Approximation for Nonlocal Lattice Delay Equations Driven by Rough Noise. https://arxiv.org/abs/2610.07076

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

KEEP EXPLORING

Related papers

arXiv2026

When is a System Discoverable from Data? Discovery Requires Chaos

The deep learning revolution has enabled major AI advances in physical sciences, particularly in discovering dynamical systems from observational data. Yet the reliability of learned surrogates and symbolically discovered models is often undermined by non-uniqueness: models may fit observed trajectories perfectly, but lack genuine predictive power. We show that chaos, despite its association with unpredictability, is often what makes governing equations discoverable. We prove that the classical Lorenz system is analytically discoverable and verify experimentally that for many systems out-of-domain generalization emerges precisely at chaos onset. Conservative systems, by contrast, are inherently non-discoverable from data alone. The prevalence of chaotic systems in benchmarks may have inadvertently obscured this limitation. These findings help explain why AI excels at weather forecasting, yet struggles in many engineering applications: the systems most amenable to discovery (chaotic ones) are often least amenable to control.

math.DS↗

arXiv2026

Foliations and minimality for twist maps

In this paper we consider area-preserving twist maps $f:\mathbf{T}^2\to\mathbf{T}^2$ with vertical rotation sets reduced to a single irrational number $α$. Our first result states that under these hypotheses, there exists a unique $f$-invariant foliation $\mathcal{F}_G=\{\operatorname{Graph}(ϕ_t)\}_{t\in\mathbf{T}^1}$, where each function $ϕ_t:\mathbf{T}^1\to\mathbf{T}^1$ is $K$-Lipschitz for some constant $K=K(f)$. Moreover, we also prove that if $\mathcal{F}_G$ is a Lipschitz foliation, then $f$ is minimal.

math.DS↗

arXiv2026

Uniqueness of Limit Cycles for Abel Equations and Planar Systems

We study positive limit cycles of the Abel equation $$\dot{x}=A(t)x^{3}+B(t)x^{2},$$ where $A$ and $B$ are $2π$-periodic functions. By developing a half-period convexity method, we establish a new criterion ensuring that the equation has at most one positive limit cycle. Moreover, if such a limit cycle exists, it is hyperbolic. As applications, we consider two classes of planar polynomial systems that can be reduced to Abel equations. For a subfamily of cubic rigid systems, we prove that there is at most one limit cycle, thereby giving a partial answer to the first problem in Gasull's list of 33 open problems. For quadratic systems, we derive a new uniqueness criterion for limit cycles surrounding the origin and provide explicit parameter regions under which the criterion is satisfied.

math.DS↗