A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS
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.
Keywords: Entropy; Graphs; Structural information; Structural information content; Topological entropy
Document Type: Research Article
Affiliations: Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Vienna, Austria
Publication date: 01 November 2008
- Information for Authors
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content