Complexity characterization in a probabilistic approach to dynamical systems through information geometry and inductive inference

Information geometric techniques and inductive inference methods hold great promise for solving computational problems of interest in classical and quantum physics, especially with regard to complexity characterization of dynamical systems in terms of their probabilistic description on curved statistical manifolds. In this paper, we investigate the possibility of describing the macroscopic behavior of complex systems in terms of the underlying statistical structure of their microscopic degrees of freedom by the use of statistical inductive inference and information geometry. We review the maximum relative entropy formalism and the theoretical structure of the information geometrodynamical approach to chaos on statistical manifolds M-S. Special focus is devoted to a description of the roles played by the sectional curvature K-MS, the Jacobi field intensity J(MS) and the information geometrodynamical entropy S-MS. These quantities serve as powerful information-geometric complexity measures of information-constrained dynamics associated with arbitrary chaotic and regular systems defined on M-S. Finally, the application of such information-geometric techniques to several theoretical models is presented.