Information processing in complex networks: Graph entropy and information functionals
- 1 July 2008
- journal article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 201 (1-2), 82-94
- https://doi.org/10.1016/j.amc.2007.12.010
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- The Chronic Fatigue Syndrome: A Comparative Pathway AnalysisJournal of Computational Biology, 2007
- Information theoretic measures of UHG graphs with low computational complexityApplied Mathematics and Computation, 2007
- Using the principle of entropy maximization to infer genetic interaction networks from gene expression patternsProceedings of the National Academy of Sciences, 2006
- A faster algorithm for betweenness centrality*The Journal of Mathematical Sociology, 2001
- Entropy and the complexity of graphs: III. Graphs with prescribed information contentBulletin of Mathematical Biology, 1968
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphsBulletin of Mathematical Biology, 1968
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graphBulletin of Mathematical Biology, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Life, information theory, and topologyBulletin of Mathematical Biology, 1955
- Communication Patterns in Task-Oriented GroupsThe Journal of the Acoustical Society of America, 1950