We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
New Upper Bound and Lower Bound for Degree-Based Network Entropy.
- Authors
Guoxiang Lu; Bingqing Li; Lijia Wang
- Abstract
The degree-based network entropy which is inspired by Shannon's entropy concept becomes the information-theoretic quantity for measuring the structural information of graphs and complex networks. In this paper, we study some properties of the degree-based network entropy. Firstly we develop a refinement of Jensen's inequality. Next we present the new and more accurate upper bound and lower bound for the degree-based network entropy only using the order, the size, the maximum degree and minimum degree of a network. The bounds have desirable performance to restrict the entropy in different kinds of graphs. Finally, we show an application to structural complexity analysis of a computer network modeled by a connected graph.
- Subjects
ENTROPY; MATHEMATICAL bounds; JENSEN'S inequality; COMPUTER networks; GRAPHIC methods
- Publication
Symmetry (20738994), 2016, Vol 8, Issue 2, p8
- ISSN
2073-8994
- Publication type
Article
- DOI
10.3390/sym8020008