复杂网络度分布的量化与比较
Quantification and Comparison of Degree Distributions in Complex Networks
摘要:
度分布是复杂网络的一个重要特征。在许多应用中,以固定长度的特征向量的形式量化度分布是必要的步骤。另一方面,我们经常需要比较两个给定网络的度分布,并提取两个分布之间的相似度。在本文中,我们提出了一种新的方法来量化复杂网络中的度分布。基于这种量化方法,还提出了一种新的距离函数的度分布,它捕捉的差异,在两个给定的分布的整体结构。所提出的方法是能够有效地比较网络,甚至与不同的尺度,并大大优于最先进的方法,相对于距离函数的准确性。
英文摘要:
The degree distribution is an important characteristic of complex networks. In many applications, quantification of degree distribution in the form of a fixed-length feature vector is a necessary step. On the other hand, we often need to compare the degree distribution of two given networks and extract the amount of similarity between the two distributions. In this paper, we propose a novel method for quantification of the degree distributions in complex networks. Based on this quantification method,a new distance function is also proposed for degree distributions, which captures the differences in the overall structure of the two given distributions. The proposed method is able to effectively compare networks even with different scales, and outperforms the state of the art methods considerably, with respect to the accuracy of the distance function.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。