Entropy Bounds for Hierarchical Molecular Networks
2008
Entropy Bounds for Hierarchical Molecular Networks
publication
Evidence: moderate
Author Information
Author(s): Dehmer Matthias, Borgert Stephan, Emmert-Streib Frank
Hypothesis
This paper investigates the problem of deriving bounds for the entropies of hierarchical graphs.
Conclusion
The study successfully derives entropy bounds for hierarchical graphs, demonstrating that the entropy measure captures significant structural information.
Supporting Evidence
- The derived bounds can be used for characterizing graph classes.
- The study provides a numerical analysis for rooted trees and generalized trees.
- Entropy bounds help reduce the complexity of problems related to large graphs.
Takeaway
The researchers figured out how to estimate the complexity of certain types of graphs, which helps us understand their structure better.
Methodology
The study derives entropy bounds for hierarchical graphs using a specific information functional based on metrical properties of graphs.
Limitations
The exact entropy value can often not be calculated concretely, especially for large graphs.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website