Information geometric methods for complexity
D. Felice, C. Cafaro, S. Mancini

TL;DR
This paper reviews how information geometry provides tools to measure and analyze complexity in physical systems, especially around phase transitions, using geometric and probabilistic methods.
Contribution
It offers a comprehensive survey of information geometric approaches to quantify complexity in classical and quantum physics, including new insights into phase transitions and network complexity.
Findings
Geometric measures effectively characterize phase transitions.
Network complexity can be quantified via Riemannian volume.
Information geometry offers versatile tools for physical complexity analysis.
Abstract
Research on the use of information geometry (IG) in modern physics has witnessed significant advances recently. In this review article, we report on the utilization of IG methods to define measures of complexity in both classical and, whenever available, quantum physical settings. A paradigmatic example of a dramatic change in complexity is given by phase transitions (PTs). Hence we review both global and local aspects of PTs described in terms of the scalar curvature of the parameter manifold and the components of the metric tensor, respectively. We also report on the behavior of geodesic paths on the parameter manifold used to gain insight into the dynamics of PTs. Going further, we survey measures of complexity arising in the geometric framework. In particular, we quantify complexity of networks in terms of the Riemannian volume of the parameter space of a statistical manifold…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
