Catching homologies by geometric entropy
arXiv:1703.07369 · doi:10.1016/j.physa.2017.09.007
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.
12 pages, 2 Figures
References in corpus (8)
- The entropy of network ensembles
- Persistent Homology of Complex Networks
- Asymptotic entropy and green speed for random walks on countable groups
- Jacobi Fields on Statistical Manifolds of Negative Curvature
- A statistical mechanics approach for scale-free networks and finite-scale networks
- The volume of Gaussian states by information geometry
- A geometric entropy detecting the Erdös-Rényi phase transition
- Random Walks on Complex Networks