Entropy Bounds for Hierarchical Molecular Networks

By Matthias Dehmer, Stephan Borgert, Frank Emmert-Streib. PLoS ONE, 2008

363 citations recorded by the source corpus.

In this paper we derive entropy bounds for hierarchical networks. More precisely, starting from a recently introduced measure to determine the topological entropy of non-hierarchical networks, we provide bounds for estimating the entropy of hierarchical graphs. Apart from bounds to estimate the entropy of a single hierarchical graph, we see that the derived bounds can also be used for characterizing graph classes. Our contribution is an important extension to previous results about the entropy of non-hierarchical networks because for practical applications hierarchical networks are playing an important role in chemistry and biology. In addition to the derivation of the entropy bounds, we provide a numerical analysis for two special graph classes, rooted trees and generalized trees, and demonstrate hereby not only the computational feasibility of our method but also learn about its characteristics and interpretability with respect to data analysis.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/87152907ad01c9305f39a6839e5c297c5af334e5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Geometry and Topology

  1. P. Donald

Citations in the corpus