Catching homologies by geometric entropy
From MaRDI portal
Publication:6284647
Statistical aspects of information-theoretic topics (62B10) Random graphs (graph-theoretic aspects) (05C80) Statistics on manifolds (62R30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Global Riemannian geometry, including pinching (53C20) Differential geometric aspects of statistical manifolds and information geometry (53B12)
Abstract: A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability to single out topological features of networks proceeding in a bottom-up manner: first we consider small size networks by analytical methods and then large size networks by numerical techniques. Two different classes of networks, the random graphs and the scale--free networks, are investigated computing their Betti numbers and then showing the capability of geometric entropy of detecting homologies.
This page was built for publication: Catching homologies by geometric entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284647)
