pith. sign in

arxiv: 0804.3057 · v1 · submitted 2008-04-18 · 🧮 math.GM · math.DS

Beyond Chaos

classification 🧮 math.GM math.DS
keywords attractorsinteractionsanalysischaosdefinesevolvefirstinteracting
0
0 comments X
read the original abstract

The first part of this paper defines recursive interactions by means of logistic functions and derives a general result on the way interacting systems evolve in attractors. It also defines the notion of coevolution trajectory and presents a new family of attractors: orbital attractors (including single, irregular, folded, complex and discontinuous orbits). The second part summarizes the results of a first experimental analysis of recursive interactions in both binary and multiple interactions. Among other results, this analysis reveals that interacting systems may easily evolve from chaos to order.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.