INFORMATION-THEORETIC CONCEPTS FOR THE ANALYSIS OF COMPLEX NETWORKS
- 26 August 2008
- journal article
- research article
- Published by Informa UK Limited in Applied Artificial Intelligence
- Vol. 22 (7-8), 684-706
- https://doi.org/10.1080/08839510802164101
Abstract
In this article, we present information-theoretic concepts for analyzing complex networks. We see that the application of information-theoretic concepts to networks leads to interesting tasks and gives a possibility for understanding information processing in networks. The main contribution of this article is a method for determining the structural information content of graphs that is based on a tree decomposition. It turns out that the computational complexity of the underlying algorithm is polynomial. Finally, we present some numerical results to study the influence of the used methods on the resulting information contents.Keywords
This publication has 37 references indexed in Scilit:
- Network AnalysisLecture Notes in Computer Science, 2005
- Complexity in Chemistry, Biology, and EcologyPublished by Springer Science and Business Media LLC ,2005
- Network biology: understanding the cell's functional organizationNature Reviews Genetics, 2004
- Graphs with maximum connectivity indexComputational Biology and Chemistry, 2003
- Recent developments in graph matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A faster algorithm for betweenness centrality*The Journal of Mathematical Sociology, 2001
- A graph distance metric based on the maximal common subgraphPattern Recognition Letters, 1998
- On the complexity of graphs and moleculesBulletin of Mathematical Biology, 1983
- Barriers to ring rotation in 1,1',4,4'-tetra-tert-butyluranocene and 1,1',3,3'-tetra-tert-butylferroceneJournal of the American Chemical Society, 1981
- Information theory, distance matrix, and molecular branchingThe Journal of Chemical Physics, 1977