Information geometric complexity of a trivariate Gaussian statistical model

From MaRDI portal
Publication:296465

DOI10.3390/E16062944zbMATH Open1338.62022arXiv1403.8100OpenAlexW2080625687MaRDI QIDQ296465FDOQ296465

Domenico Felice, Stefano Mancini, Carlo Cafaro

Publication date: 15 June 2016

Published in: Entropy (Search for Journal in Brave)

Abstract: We evaluate the information geometric complexity of entropic motion on low-dimensional Gaussian statistical manifolds in order to quantify how difficult is making macroscopic predictions about a systems in the presence of limited information. Specifically, we observe that the complexity of such entropic inferences not only depends on the amount of available pieces of information but also on the manner in which such pieces are correlated. Finally, we uncover that for certain correlational structures, the impossibility of reaching the most favorable configuration from an entropic inference viewpoint, seems to lead to an information geometric analog of the well-known frustration effect that occurs in statistical physics.


Full work available at URL: https://arxiv.org/abs/1403.8100




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Information geometric complexity of a trivariate Gaussian statistical model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296465)