Formal proof of the approximation of a random phenomenon by a chaotic phenomenon
Mohamed El Ouafi, Hajar Ahalli, Abderrahim Aslimani, Kaoutar Lamrini Uahabi

TL;DR
This paper explores the theoretical connection between chaos and randomness, demonstrating that under specific conditions, a random phenomenon can be approximated by a chaotic system, bridging the gap between deterministic chaos and probabilistic processes.
Contribution
It provides a formal proof establishing conditions under which a random phenomenon can be approximated by a chaotic phenomenon, clarifying their relationship.
Findings
Established a formal proof linking randomness and chaos
Identified conditions for approximation of randomness by chaos
Clarified the conceptual distinction and connection between chaos and randomness
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
