Related papers: Predictability: a way to characterize Complexity
Predictive inference requires balancing statistical accuracy against informational complexity, yet the choice of complexity measure is usually imposed rather than derived. We treat econometric objects as predictive rules, mappings from…
Adaptive dynamical systems arise in a multitude of contexts, e.g., optimization, control, communications, signal processing, and machine learning. A precise characterization of their fundamental limitations is therefore of paramount…
The striking fractal geometry of strange attractors underscores the generative nature of chaos: like probability distributions, chaotic systems can be repeatedly measured to produce arbitrarily-detailed information about the underlying…
We develop a formalism to describe the discrete-time dynamics of systems containing an arbitrary number of interacting species. The individual-based model, which forms our starting point, is described by a Markov chain, which in the limit…
This paper is the second in a series of two, and describes the current state of the art in modelling and prediction of chaotic time series. Sampled data from deterministic non-linear systems may look stochastic when analysed with linear…
While the notion of chaos is well established for dynamical systems on manifolds, it is not so for dynamical systems over discrete spaces with $ N $ variables, as binary neural networks and cellular automata. The main difficulty is the…
This is a review of aspects of the theory of algorithmic information that may contribute to a framework for formulating questions related to complex highly unpredictable systems. We start by contrasting Shannon Entropy and…
We propose a simple complexity indicator of classical Liouvillian dynamics, namely the separability entropy, which determines the logarithm of an effective number of terms in a Schmidt decomposition of phase space density with respect to an…
Shannon information entropy is a natural measure of probability (de)localization and thus (un)predictability in various procedures of data analysis for model systems. We pay particular attention to links between the Shannon entropy and the…
We discuss how to characterize the behavior of a chaotic dynamical system depending on a parameter that varies periodically in time. In particular, we study the predictability time, the correlations and the mean responses, by defining a…
It is argued that the two problems of choosing characterizations and models of complex systems should not be considered independently. A particular criterion for these choices, oriented on the potential usefulness of the results, is…
Verification of discrete time or continuous time dynamical systems over the reals is known to be undecidable. It is however known that undecidability does not hold for various classes of systems: if robustness is defined as the fact that…
From the analyticity properties of the equation governing infinitesimal perturbations, it is shown that all stability properties of spatially extended 1D systems can be derived from a single function that we call entropy potential since it…
Robustness of linear systems with constant coefficients is considered. There exist methods and tools for analyzing the stability of systems with random or deterministic uncertainties. At the same time, there are no approaches for the…
Chaos and turbulence are complex physical phenomena, yet a precise definition of the complexity measure that quantifies them is still lacking. In this work we consider the relative complexity of chaos and turbulence from the perspective of…
We study the robustness of system estimation to parametric perturbations in system dynamics and initial conditions. We define the problem of sensitivity-based parametric uncertainty quantification in dynamical system estimation. The main…
The problem of behaviour prediction for linear parameter-varying systems is considered in the interval framework. It is assumed that the system is subject to uncertain inputs and the vector of scheduling parameters is unmeasurable, but all…
We study the coherent dynamics of globally coupled maps showing macroscopic chaos. With this term we indicate the hydrodynamical-like irregular behaviour of some global observables, with typical times much longer than the times related to…
A procedure to characterize chaotic dynamical systems with concepts of complex networks is pursued, in which a dynamical system is mapped onto a network. The nodes represent the regions of space visited by the system, while edges represent…
We present a complexity measure for any finite time series. This measure has invariance under any monotonic transformation of the time series, has a degree of robustness against noise, and has the adaptability of satisfying almost all the…