arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0903.5025physics.soc-phphysics.data-an
收藏

连续节点度:一种新的复杂网络度量

The Continuous Node Degree: a New Measure for Complex Networks

Sherief Abdallah

摘要:

在分析复杂网络中广泛使用的一个关键度量是节点的度(节点邻居的数量)。由于其离散性,当度度量用于分析加权网络时,权重被忽略或阈值化以保留或忽略边缘。因此,尽管它很受欢迎,但度度量无法捕捉节点与其邻居之间交互的差异。在本文中,我们介绍了一个推广的程度测量,解决这个限制:连续节点度(C度)。节点的C度反映了有多少邻居被有效地使用,考虑到交互差异。更重要的是,如果一个节点均匀地与它的邻居相互作用(没有相互作用的差距),我们证明了节点的C度变得相同的节点的(离散)度。我们使用新的度量分析了四个真实世界的加权网络,并表明C度分布遵循幂律,类似于传统的度分布,但下降更陡。我们还表明,C度和(离散)度之间的比率遵循一种模式,这是常见的四个研究网络。

英文摘要:

A key measure that has been used extensively in analyzing complex networks is the degree of a node (the number of the node's neighbors). Because of its discrete nature, when the degree measure was used in analyzing weighted networks, weights were either ignored or thresholded in order to retain or disregard an edge. Therefore, despite its popularity, the degree measure fails to capture the disparity of interaction between a node and its neighbors. We introduce in this paper a generalization of the degree measure that addresses this limitation: the continuous node degree (C-degree). The C-degree of a node reflects how many neighbors are effectively being used, taking interaction disparity into account. More importantly, if a node interacts uniformly with its neighbors (no interaction disparity), we prove that the C-degree of the node becomes identical to the node's (discrete) degree. We analyze four real-world weighted networks using the new measure and show that the C-degree distribution follows the power-law, similar to the traditional degree distribution, but with steeper decline. We also show that the ratio between the C-degree and the (discrete) degree follows a pattern that is common in the four studied networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑