On the concept of complexity in random dynamical systems
arXiv:cond-mat/9505054 · doi:10.1103/PhysRevE.53.2087
Abstract
We introduce a measure of complexity in terms of the average number of bits per time unit necessary to specify the sequence generated by the system. In random dynamical system, this indicator coincides with the rate K of divergence of nearby trajectories evolving under two different noise realizations. The meaning of K is discussed in the context of the information theory, and it is shown that it can be determined from real experimental data. In presence of strong dynamical intermittency, the value of K is very different from the standard Lyapunov exponent computed considering two nearby trajectories evolving under the same randomness. However, the former is much more relevant than the latter from a physical point of view as illustrated by some numerical computations for noisy maps and sandpile models.
35 pages, LaTeX
References in corpus (1)
Cited by in corpus (15)
- Predictability: a way to characterize Complexity
- Analytical and Numerical Studies of Noise-induced Synchronization of Chaotic Systems
- Signatures of Noise Enhanced Stability in Metastable States
- Stability measures in metastable states with Gaussian colored noise
- Are generalized synchronization and noise--induced synchronization identical types of synchronous behavior of chaotic oscillators?
- Exact solutions to chaotic and stochastic systems
- Short period attractors and non-ergodic behavior in the deterministic fixed energy sandpile model
- Experimental detection of long-distance interactions between biomolecules through their diffusion behavior: Numerical study
- Characterization of chaos in random maps
- Dynamical entropy for systems with stochastic perturbation
- Chaos and Noise
- Intrinsic chaos and external noise in population dynamics
- Hierarchy of random deterministic chaotic maps with an invariant measure
- Synchronization of Random Linear Maps
- A Model for Prejudiced Learning in Noisy Environments