CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Entropies of complex networks with hierarchically constrained topologies Export

Physical Review E, Vol. 78, No. 1. (July 2008), pp. 016114-1-016114-15.

Citation Format

[Posts]

View FullText article


statnet's tags for this article

complex entropies entropy hierarchicallyconstrained networks topologies

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X Abstract

The entropy of a hierarchical network topology in an ensemble of sparse random networks, with “hidden variables” associated with 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 keys with which to solve the general problem of “fitting” a given network with an appropriate ensemble of random networks.


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.