大型无标度网络中的反渗透性
Uncovering disassortativity in large scale-free networks
摘要:
在大型自组织网络中,如互联网、万维网、社会网络和生物网络中的混合模式通常以相邻节点之间的度-度依赖为特征。在本文中,我们提出了一种新的方法来衡量度-度依赖。常用的折射率系数的一个问题是,在离散网络中,它的大小随着网络的大小而减小。我们从数学上解释了这一现象,并在合成图和真实网络数据上验证了结果。作为替代方案,我们建议使用等级相关性度量,例如Spearman rho。我们的实验令人信服地表明,斯皮尔曼的rho产生一致的值在不同大小的图,但类似的结构,它是能够揭示强(正或负)的依赖关系在大型图。特别是,我们发现更强的负度度依赖关系的Web图比以前认为的。{Rank相关性使我们能够比较不同大小的网络的重复性,这是不可能的重复性系数,因为它真正依赖于网络的大小。我们的结论是,秩相关性提供了一个合适的和翔实的方法来揭示网络混合模式。
英文摘要:
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, social and biological networks are often characterized by degree-degree dependencies between neighbouring nodes. In this paper we propose a new way of measuring degree-degree dependencies. One of the problems with the commonly used assortativity coefficient is that in disassortative networks its magnitude decreases with the network size. We mathematically explain this phenomenon and validate the results on synthetic graphs and real-world network data. As an alternative, we suggest to use rank correlation measures such as Spearman's rho. Our experiments convincingly show that Spearman's rho produces consistent values in graphs of different sizes but similar structure, and it is able to reveal strong (positive or negative) dependencies in large graphs. In particular, we discover much stronger negative degree-degree dependencies} in Web graphs than was previously thought. {Rank correlations allow us to compare the assortativity of networks of different sizes, which is impossible with the assortativity coefficient due to its genuine dependence on the network size. We conclude that rank correlations provide a suitable and informative method for uncovering network mixing patterns.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。