具有给定度分布的随机网络的熵分布与凝聚
Entropy distribution and condensation in random networks with a given degree distribution
摘要:
网络集成的熵表征了网络结构中编码的信息量,并且可以用于量化网络复杂性,以及在真实网络数据集中观察到的给定结构属性相对于随机假设的相关性。在许多真实网络中,单个节点的度不是固定的,而是随时间变化的,而它们的统计特性,如度分布,是保持不变的。在这里,我们刻画了具有给定度序列的随机网络的熵分布,其中每个度序列是从给定的度分布中随机抽取的。我们发现,无标度网络系综的熵的主导项只依赖于网络的大小和平均度,熵是自平均的,这意味着它的相对方差在热力学极限为零。我们还描述了熵的大波动,这些波动完全由网络中的平均度决定。最后,在某个阈值之上,集合中平均度的大波动可能导致凝聚,这意味着大小为~ $N$的网络中的单个节点可以吸引$O(N)$链接。
英文摘要:
The entropy of network ensembles characterizes the amount of information encoded in the network structure, and can be used to quantify network complexity, and the relevance of given structural properties observed in real network datasets with respect to a random hypothesis. In many real networks the degrees of individual nodes are not fixed but change in time, while their statistical properties, such as the degree distribution, are preserved. Here we characterize the distribution of entropy of random networks with given degree sequences, where each degree sequence is drawn randomly from a given degree distribution. We show that the leading term of the entropy of scale-free network ensembles depends only on the network size and average degree, and that entropy is self-averaging, meaning that its relative variance vanishes in the thermodynamic limit. We also characterize large fluctuations of entropy that are fully determined by the average degree in the network. Finally, above a certain threshold, large fluctuations of the average degree in the ensemble can lead to condensation, meaning that a single node in a network of size~$N$ can attract $O(N)$ links.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。