Quantifying The Complexity Of Geodesic Paths On Curved Statistical Manifolds Through Information Geometric Entropies and Jacobi Fields

Abstract

We characterize the complexity of geodesic paths on a curved statistical manifold Ms through the asymptotic computation of the information geometric complexity VMs and the Jacobi vector field intensity JMs. The manifold Ms is a 2l-dimensional Gaussian model reproduced by an appropriate embedding in a larger 4l-dimensional Gaussian manifold and endowed with a Fisher-Rao information metric gμ() with non-trivial off diagonal terms. These terms emerge due to the presence of a correlational structure (embedding constraints) among the statistical variables on the larger manifold and are characterized by macroscopic correlational coefficients rk. First, we observe a power law decay of the information geometric complexity at a rate determined by the coefficients rk and conclude that the non-trivial off diagonal terms lead to the emergence of an asymptotic information geometric compression of the explored macrostates on Ms. Finally, we observe that the presence of such embedding constraints leads to an attenuation of the asymptotic exponential divergence of the Jacobi vector field intensity.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…