A geometric entropy detecting the Erdös-Rényi phase transition
arXiv:1507.08409 · doi:10.1209/0295-5075/111/20001
Abstract
We propose a method to associate a differentiable Riemannian manifold to a generic many degrees of freedom discrete system which is not described by a Hamiltonian function. Then, in analogy with classical Statistical Mechanics, we introduce an entropy as the logarithm of the volume of the manifold. The geometric entropy so defined is able to detect a paradigmatic phase transition occurring in random graphs theory: the appearance of the `giant component' according to the Erdös-Rényi theorem.
arXiv comment11 pages, 3 figures. arXiv admin note: substantial text overlap with arXiv:1410.5459
References in corpus (16)
- Statistical mechanics of complex networks
- Network robustness and fragility: Percolation on random graphs
- Critical phenomena in complex networks
- The entropy of network ensembles
- The entropy of randomized network ensembles
- Entropy Rate of Diffusion Processes on Complex Networks
- The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Percolation on dense graph sequences
- Entropies of complex networks with hierarchically constrained topologies
- Homogeneous complex networks
- Asymptotic entropy and green speed for random walks on countable groups
- Works on an information geometrodynamical approach to chaos
- Single particle in quantum gravity and Braunstein-Ghosh-Severini entropy of a spin network
- The emergence of a giant component in random subgraphs of pseudo-random graphs
- Quantifying Networks Complexity from Information Geometry Viewpoint
- Random Walks on Complex Networks
Cited by in corpus (9)
- Network geometry with flavor: from complexity to quantum geometry
- Interdisciplinary and physics challenges of Network Theory
- Information geometric methods for complexity
- Geometric Algebra and Information Geometry for Quantum Computational Software
- Theoretical investigations of an information geometric approach to complexity
- Microcanonical entropy for classical systems
- Riemannian-geometric entropy for measuring network complexity
- Towards an Information Geometric characterization/classification of Complex Systems. I. Use of Generalized Entropies
- Catching homologies by geometric entropy