Shannon and von Neumann entropy of random networks with heterogeneous expected degree
Shannon and von Neumann entropy of random networks with heterogeneous expected degree
复制标题
DOI：
10.1103/physreve.83.036109
复制
发表时间：
2011-03-18
影响因子：
2.4
通讯作者：
Severini, Simone
中科院分区：
文献类型：
--
作者：
Anand, Kartik;Bianconi, Ginestra;Severini, Simone
复杂性的熵度量能够量化复杂网络结构中编码的信息。在这方面已经提出了几种熵度量方法。在这里，我们研究具有给定期望度序列的网络的香农熵和冯·诺依曼熵之间的关系。我们在不同的网络拓扑示例中发现，当度分布包含一些异质性时，这两种熵量之间会出现一种有趣的相关性。这一结果似乎表明，期望度分布中的异质性意味着网络的量子描述和经典描述之间的等效性，它们分别对应于冯·诺依曼熵和香农熵。
Entropic measures of complexity are able to quantify the information encoded in complex network structures. Several entropic measures have been proposed in this respect. Here we study the relation between the Shannon entropy and the von Neumann entropy of networks with given expected degree sequence. We find in different examples of network topologies that when the degree distribution contains some heterogeneity, an intriguing correlation emerges between the two entropic quantities. This results seems to suggest that heterogeneity in the expected degree distribution is implying an equivalence between a quantum and a classical description of networks, which respectively corresponds to the von Neumann and the Shannon entropy.