Next Article in Journal
Directionality Theory and the Entropic Principle of Natural Selection
Next Article in Special Issue
New Insights into the Fractional Order Diffusion Equation Using Entropy and Kurtosis
Previous Article in Journal
Performance Degradation Assessment of Rolling Element Bearings Based on an Index Combining SVD and Information Exergy
Previous Article in Special Issue
Adaptive Leader-Following Consensus of Multi-Agent Systems with Unknown Nonlinear Dynamics
Article Menu

Export Article

Open AccessArticle
Entropy 2014, 16(10), 5416-5427; doi:10.3390/e16105416

A Note on Distance-based Graph Entropies

1
College of Computer and Control Engineering, Nankai University, No. 94 Weijin Road, 300071 Tianjin, China
2
Department of Computer Science, Universität der Bundeswehr München, Werner-Heisenberg-Weg 39, 85577 Neubiberg, Germany
3
Institute for Bioinformatics and Translational Research, UMIT, Eduard Wallnoefer Zentrum A-6060, Hall in Tyrol, Austria
4
Center for Combinatorics and LPMC-TJKLC, Nankai University, No. 94 Weijin Road, 300071 Tianjin, China
*
Author to whom correspondence should be addressed.
Received: 26 July 2014 / Revised: 18 September 2014 / Accepted: 15 October 2014 / Published: 20 October 2014
(This article belongs to the Special Issue Complex Systems and Nonlinear Dynamics)
View Full-Text   |   Download PDF [161 KB, uploaded 24 February 2015]   |  

Abstract

A variety of problems in, e.g., discrete mathematics, computer science, information theory, statistics, chemistry, biology, etc., deal with inferring and characterizing relational structures by using graph measures. In this sense, it has been proven that information-theoretic quantities representing graph entropies possess useful properties such as a meaningful structural interpretation and uniqueness. As classical work, many distance-based graph entropies, e.g., the ones due to Bonchev et al. and related quantities have been proposed and studied. Our contribution is to explore graph entropies that are based on a novel information functional, which is the number of vertices with distance \(k\) to a given vertex. In particular, we investigate some properties thereof leading to a better understanding of this new information-theoretic quantity. View Full-Text
Keywords: entropy; Shannon’s entropy; graph entropy; distance; networks entropy; Shannon’s entropy; graph entropy; distance; networks
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Chen, Z.; Dehmer, M.; Shi, Y. A Note on Distance-based Graph Entropies. Entropy 2014, 16, 5416-5427.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top