Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/110857
Title: | Entropy bounds for hierarchical molecular networks | Authors: | Dehmer, Matthias Borgert, Stephan Emmert-Streib, Frank |
Issue Date: | 28-Aug-2008 | Publisher: | Public Library of Science | Project: | European FP6-NEST-Adventure Programme, contract No. 028875 | Serial title, monograph or event: | PLoS ONE | Volume: | 3 | Issue: | 8 | Abstract: | 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. | URI: | https://hdl.handle.net/10316/110857 | ISSN: | 1932-6203 | DOI: | 10.1371/journal.pone.0003079 | Rights: | openAccess |
Appears in Collections: | FCTUC Matemática - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Entropy-bounds-for-hierarchical-molecular-networksPLoS-ONE.pdf | 229.23 kB | Adobe PDF | View/Open |
Page view(s)
53
checked on Sep 25, 2024
Download(s)
29
checked on Sep 25, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License