Entropy Bounds for Hierarchical Molecular Networks

Matthias Dehmer, Stephan Borgert, Frank Emmert-Streib · 2008

Read Entropy Bounds for Hierarchical Molecular Networks by Matthias Dehmer, Stephan Borgert, Frank Emmert-Streib (2008) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/plos-pone-0003079.txt.

Description

Matthias Dehmer, Stephan Borgert and Frank Emmert-Streib derived entropy bounds for hierarchical networks in 2008. Their paper starts from a recently introduced measure of topological entropy for non-hierarchical networks. Entropy here gauges a network's structural complexity in a single number.

The authors provide bounds for estimating the entropy of hierarchical graphs, networks built in layers. Bounds give a fast range without full computation. Published in PLOS ONE, molecular networks are often layered, so the result serves systems biology as well as pure graph theory. The complete article sets out the methods and data behind each claim in full.

Catalog record

CREATORMatthias Dehmer, Stephan Borgert, Frank Emmert-Streib
YEAR2008
COLLECTIONPAPERS
FORMATTXT
FILE SIZE43 KB
LICENSECreative Commons Attribution License
RIGHTSCC BY
SOURCEPLOS ONE

Source: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0003079

Browse the full library · About the Tower of Babel