Recent Developments in Quantitative Graph Theory: Information Inequalities for Networks
Open Access
- 15 February 2012
- journal article
- research article
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 7 (2), e31395
- https://doi.org/10.1371/journal.pone.0031395
Abstract
In this article, we tackle a challenging problem in quantitative graph theory. We establish relations between graph entropy measures representing the structural information content of networks. In particular, we prove formal relations between quantitative network measures based on Shannon's entropy to study the relatedness of those measures. In order to establish such information inequalities for graphs, we focus on graph entropy measures based on information functionals. To prove such relations, we use known graph classes whose instances have been proven useful in various scientific areas. Our results extend the foregoing work on information inequalities for graphs.This publication has 23 references indexed in Scilit:
- Connections between Classical and Parametric Network EntropiesPLOS ONE, 2011
- A history of graph entropy measuresInformation Sciences, 2011
- A Network Model of Interpersonal Alignment in DialogEntropy, 2010
- Entropy measures for networks: Toward an information theory of complex topologiesPhysical Review E, 2009
- Entropy Bounds for Hierarchical Molecular NetworksPLOS ONE, 2008
- Characterization of complex networks: A survey of measurementsAdvances in Physics, 2007
- The complexity of social networks: theoretical and empirical findingsSocial Networks, 2001
- New vertex invariants and topological indices of chemical graphs based on information on distancesJournal of Mathematical Chemistry, 1991
- Centrality in social networks conceptual clarificationSocial Networks, 1979
- A Set of Measures of Centrality Based on BetweennessSociometry, 1977