Work

Towards Information Inequalities for Generalized Graph Entropies

Year: 2012

Type: article

Abstract: In this article, we discuss the problem of establishing relations between information measures for network structures. Two types of entropy based measures namely, the Shannon entropy and its generalization, the Rényi entropy have been considered for this study. Our main results involve establishing formal relationships, by means of inequalities, between these two kinds of measures. Further, we also state and prove inequalities connecting the classical partition-based graph entropies and partition-independent entropy measures. In addition, several explicit inequalities are derived for special classes of graphs.

Source: PLoS ONE

DOI: 10.1371/journal.pone.0038159

Authors: Lavanya Sivakumar, Matthias Dehmer

Institutions: Institute of Mathematical Sciences, UMIT TIROL - Private University for Health Sciences and Health Technology

Language: English

Topic: Graph theory and applications

Subfield: Geometry and Topology

Field: Mathematics

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $1,299

Funder: Austrian Science Fund