A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS

Authors:
Matthias Dehmer
Affiliations:
Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Vienna, Austria
Venue:
Cybernetics and Systems
Year:
2008

Citing 2
Cited 2

A Mathematical Theory of Communication

A Mathematical Theory of Communication
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

INFORMATION-THEORETIC CONCEPTS FOR THE ANALYSIS OF COMPLEX NETWORKS

Applied Artificial Intelligence
A history of graph entropy measures

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such entropic measures can be very important and useful to analyze and compare complex systems by means of networks. The novel graph entropy definition is based on local vertex functionals obtained by calculating j-spheres via the algorithm of Dijkstra. We state some lower and upper bounds of the defined graph entropy to estimate the structural information content for graph classes or explicitly given graphs. Second, we present a detailed example for calculating the graph entropies of a special graph class.