Bounds for degree-based network entropies

Zengqiang Chen, Matthias Dehmer and Yongtang Shi

Applied Mathematics and Computation, 2015, vol. 265, issue C, 983-993

Abstract: In this paper, we continue studying degree-based entropies for networks. The quantities represent information-theoretic network measures which are based on using information functionals involving vertex degrees. We prove bounds for entropies which are based on information functionals using degree powers and come up with interrelations between different measures. Such interrelations are important to study connections between the measures required to understand the measures in depth.

Keywords: Shannon’s entropy; Graph entropy; Degree powers (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315007791
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:265:y:2015:i:c:p:983-993

DOI: 10.1016/j.amc.2015.06.003

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().