Quantifying networks complexity from information geometry viewpoint
From MaRDI portal
Publication:5171340
DOI10.1063/1.4870616zbMath1305.90093arXiv1310.7825OpenAlexW3101241090MaRDI QIDQ5171340
Stefano Mancini, Domenico Felice, 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
Stochastic network models in operations research (90B15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17)
Related Items
Geometric algebra and information geometry for quantum computational software ⋮ An information geometric perspective on the complexity of macroscopic predictions arising from incomplete information ⋮ Information geometric complexity of a trivariate Gaussian statistical model ⋮ Catching homologies by geometric entropy ⋮ Information geometric methods for complexity ⋮ The volume of Gaussian states by information geometry ⋮ Theoretical investigations of an information geometric approach to complexity
Cites Work
This page was built for publication: Quantifying networks complexity from information geometry viewpoint