Formal proof of the approximation of a random phenomenon by a chaotic phenomenon

Mohamed El Ouafi; Hajar Ahalli; Abderrahim Aslimani; Kaoutar Lamrini Uahabi

Home/Archive/arXiv

arXiv · 2507.08209

Formal proof of the approximation of a random phenomenon by a chaotic phenomenon

Mohamed El Ouafi·Hajar Ahalli·Abderrahim Aslimani·Kaoutar Lamrini Uahabi

View original source ↗Read source document ↗Export metadata ↓

Abstract

This article examines the subtle relationship between chaos and randomness, two concepts that, although they refer to seemingly unpredictable phenomenon, are based on fundamentally different principles. Chaos manifests in deterministic systems where small variations in initial conditions lead to unpredictable long-term behaviors, while randomness pertains to intrinsically probabilistic processes, characterized by fundamental uncertainty. Although these phenomena are based on distinct mechanisms, they can interact and converge in contexts as varied as the modeling of natural phenomena, climate forecasts, or financial markets. Despite their differences, these two phenomena share common characteristics, such as the absence of apparent order and an unpredictability that defies our attempts at long-term prediction. Through an analysis of chaos theory and probability, this article aims to clarify the distinctions and highlight the deep connections between these two concepts in real systems. The objective of this article is to present a comprehensive approach aimed at demonstrating that, under certain conditions, a random phenomenon can be effectively represented and approximated by a chaotic phenomenon. By examining this possibility, we seek to establish the theoretical foundations that connect these two concepts, often perceived as distinct, but whose dynamics could prove to be analogous in certain contexts.

Explore related subjects

math.DS

Keep this discovery

BibTeX RIS

Mohamed El Ouafi, Hajar Ahalli, Abderrahim Aslimani, Kaoutar Lamrini Uahabi. 2025-07-10. Formal proof of the approximation of a random phenomenon by a chaotic phenomenon. https://arxiv.org/abs/2507.08209

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

KEEP EXPLORING

Related papers

arXiv2026

Admissible Fourier Lengths, KAM Reducibility, and Spectral Applications

We develop a perturbative KAM reducibility theory for one-frequency $\mathrm{SL}(2,\mathbb{R})$ cocycles based on an admissible Fourier length $\ell$. The regularity relevant to the iteration is measured by positive adapted Fourier width rather than ordinary smoothness in the Euclidean length $|n|$. The same length governs Fourier decay, truncation and resonance scales, and the arithmetic condition controlling the small divisors. This framework contains the classical analytic and Gevrey settings, while non-monotone choices of $\ell$ allow classical nowhere differentiable Weierstrass-type perturbations and continuous perturbations outside every positive H\"older class. As spectral applications, we obtain purely absolutely continuous spectrum for every phase and $1/2$-H\"older continuity of the integrated density of states for the associated quasiperiodic Schr\"odinger operators. The Aubry dual has pure point spectrum for Lebesgue almost every dual phase, with eigenfunctions exponentially localized in the metric induced by $\ell$. We also construct nowhere differentiable quasiperiodic potentials with purely absolutely continuous Cantor spectrum.

math.DS↗

arXiv2026

Dynamics inside the attracting basins of some skew products

Polynomial skew products in $\mathbb{C}^2$ are maps of the form $F(z,w)=(P(z),Q(z,w))$, where $P$ and $Q$ are polynomials. Their local dynamics have been widely investigated. In this paper, we study the global dynamics inside Fatou components of some skew products. We consider all the inverse images in a Fatou component of a given point and use the Kobayashi metric to measure the distance between points. In the cases we consider, there are always arbitrarily large Kobayashi balls in the complement of these inverse sets.

math.DS↗

arXiv2026

Ergodicity of dynamical systems without uniqueness of orbits

Recently, there has been considerable interest in the study of non-deterministic dynamical systems. To analyze the chaotic behavior of such systems from a measure-theoretic viewpoint, it is desirable to consider ergodicity. However, the classical definition of ergodicity involves invariant sets, whose definition is not unique for non-deterministic dynamical systems. Thus, we are led to the question of which invariance yields an interesting definition of ergodicity. Here, we propose a definition based on the strong backward invariance and show that analogs of classical results hold. We also consider implications of the Birkhoff ergodic theorem for systems without uniqueness of orbits.

math.DS↗