Entropies of complex networks with hierarchically constrained topologies
arXiv:0803.1247 · doi:10.1103/PhysRevE.78.016114
Abstract
The entropy of a hierarchical network topology in an ensemble of sparse random networks with "hidden variables" associated to its nodes, is the log-likelihood that a given network topology is present in the chosen ensemble.We obtain a general formula for this entropy,which has a clear simple interpretation in some simple limiting cases. The results provide new keys with which to solve the general problem of "fitting" a given network with an appropriate ensemble of random networks.
(18 pages)
References in corpus (5)
- Mixture models and exploratory analysis in networks
- The entropy of randomized network ensembles
- Kullback-Leibler distance as a measure of the information filtered from multivariate data
- Sparsely-spread CDMA - a statistical mechanics based analysis
- Statistical Mechanics Analysis of LDPC Coding in MIMO Gaussian Channels