PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Entropies of complex networks with hierarchically constrained topologies
Ginestra Bianconi, Anthony Coolen and Conrad Perez-Vicente
Physical Review E Volume 78, 016114, 2008.

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 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.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:5353
Deposited By:Anthony (Ton) C C Coolen
Deposited On:24 March 2009