On the complexity of statistical models admitting correlations
From MaRDI portal
Abstract: We compute the asymptotic temporal behavior of the dynamical complexity associated with the maximum probability trajectories on Gaussian statistical manifolds in presence of correlations between the variables labeling the macrostates of the system. The algorithmic structure of our asymptotic computations is presented and special focus is devoted to the diagonalization procedure that allows to simplify the problem in a remarkable way. We observe a power law decay of the information geometric complexity at a rate determined by the correlation coefficient. We conclude that macro-correlations lead to the emergence of an asymptotic information geometric compression of the statistical macrostates explored on the configuration manifold of the model in its evolution between the initial and final macrostates.
Recommendations
- Information geometric complexity of a trivariate Gaussian statistical model
- Quantifying the complexity of geodesic paths on curved statistical manifolds through information geometric entropies and Jacobi fields
- Softening the complexity of entropic motion on curved statistical manifolds
- Quantifying networks complexity from information geometry viewpoint
- Correlated-Walks Seen from the Viewpoint of Information Geometry.
Cited in
(4)- An information geometric perspective on the complexity of macroscopic predictions arising from incomplete information
- Information geometric complexity of a trivariate Gaussian statistical model
- Theoretical investigations of an information geometric approach to complexity
- Quantifying the complexity of geodesic paths on curved statistical manifolds through information geometric entropies and Jacobi fields
This page was built for publication: On the complexity of statistical models admitting correlations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3162752)