Information-theoretic concepts for the analysis of complex networks
Information-theoretic concepts for the analysis of complex networks
复制标题
DOI：
10.1080/08839510802164101
复制
发表时间：
2008-01-01
影响因子：
2.8
通讯作者：
Dehmer, Matthias
中科院分区：
文献类型：
--
作者：
Dehmer, Matthias
在本文中，我们提出了用于分析复杂网络的信息论概念。我们看到，信息论概念在网络中的应用导致了有趣的任务，并为理解网络中的信息处理提供了可能性。本文的主要贡献是一种确定图的结构信息内容的方法，该方法基于树分解。结果表明，底层算法的计算复杂度是多项式的。最后，我们给出了一些数值结果来研究所使用的方法对结果信息量的影响。
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.