Please use this identifier to cite or link to this item:
Title: Entropy bounds for hierarchical molecular networks
Authors: Dehmer, Matthias 
Borgert, Stephan 
Emmert-Streib, Frank 
Keywords: Hierarchical networks; Molecular networks; Graph entropy; Graph measures
Issue Date: 2008
Publisher: Centro de Matemática da Universidade de Coimbra
Citation: Pré-Publicações DMUC. 08-40 (2008)
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.
Rights: openAccess
Appears in Collections:FCTUC Matemática - Vários

Files in This Item:
File Description SizeFormat
Entropy bounds for hierarchical molecular networks.pdf244.43 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on Aug 11, 2022


checked on Aug 11, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.