Quantifying networks complexity from information geometry viewpoint

DOI10.1063/1.4870616MaRDI QIDQ5171340zbMATH OpenOpenAlexFDO

Authors Domenico Felice, Stefano Mancini, Marco Pettini

Publication date 26 July 2014

Published in Journal of Mathematical Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Stochastic network models in operations research (90B15) Measures of information, entropy (94A17)

Abstract: We consider a Gaussian statistical model whose parameter space is given by the variances of random variables. Underlying this model we identify networks by interpreting random variables as sitting on vertices and their correlations as weighted edges among vertices. We then associate to the parameter space a statistical manifold endowed with a Riemannian metric structure (that of Fisher-Rao). Going on, in analogy with the microcanonical definition of entropy in Statistical Mechanics, we introduce an entropic measure of networks complexity. We prove that it is invariant under networks isomorphism. Above all, considering networks as simplicial complexes, we evaluate this entropy on simplexes and find that it monotonically increases with their dimension.

Recommendations

• Information-based complexity of networks
• A new information dimension of complex networks
• An information dimension of weighted complex networks
• Structural Information and Dynamical Complexity of Networks
• Information processing in complex networks: Graph entropy and information functionals
• Maximal entropy coverings and the information dimension of a complex network
• Euclidean Information Theory of Networks
• Analyzing complex networks evolution through Information Theory quantifiers

Cites work

• A geometric approach to complexity
• Geometry and topology in Hamiltonian dynamics and statistical mechanics
• scientific article; zbMATH DE number 1964693 (Why is no real title available?)
• scientific article; zbMATH DE number 1560711 (Why is no real title available?)
• scientific article; zbMATH DE number 3235051 (Why is no real title available?)
• Introduction to algorithms.
• Measures of statistical complexity: why?
• Statistical mechanics of complex networks
• What is complexity?

Cited in

(16)

• Geometric algebra and information geometry for quantum computational software
• An information geometric perspective on the complexity of macroscopic predictions arising from incomplete information
• Network geometry and complexity
• Catching homologies by geometric entropy
• A box-covering Tsallis information dimension and non-extensive property of complex networks
• Maximal entropy coverings and the information dimension of a complex network
• Information-geometric measures for estimation of connection weight under correlated inputs
• Information geometry, simulation and complexity in Gaussian random fields
• The volume of Gaussian states by information geometry
• Information geometric complexity of a trivariate Gaussian statistical model
• On the complexity of statistical models admitting correlations
• Information geometric methods for complexity
• Gaussian curvature of spherical shells: a geometric measure of complexity
• Theoretical investigations of an information geometric approach to complexity
• A new information dimension of complex networks
• Information geometry and Bose-Einstein condensation

This page was built for publication: Quantifying networks complexity from information geometry viewpoint

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