给定度分布的最大判别图的生成
Generating maximally disassortative graphs with given degree distribution
摘要:
在本文中,我们考虑的最优化问题的生成图与规定的度分布,使连接节点的度之间的相关性,作为衡量斯皮尔曼的ρ,是最小的。我们提供了一个算法来解决这个问题,并获得一个完整的表征联合度分布在这些最大dispertative图,在尺寸偏置度分布。结果得到了具有任意给定度分布的图的Spearman ρ的一个下界。我们使用这个下界表明,对于任何固定的尾部指数,存在无标度的度序列与此指数,使得斯皮尔曼的rho的最小值为所有的图与这样的度序列是任意接近于零。这意味着只指定度分布的尾部行为,就像在复杂网络分析中经常做的那样,不能保证斯皮尔曼ρ的最小值。
英文摘要:
In this paper we consider the optimization problem of generating graphs with a prescribed degree distribution, such that the correlation between the degrees of connected nodes, as measured by Spearman's rho, is minimal. We provide an algorithm for solving this problem and obtain a complete characterization of the joint degree distribution in these maximally disassortative graphs, in terms of the size-biased degree distribution. As a result we get a lower bound for Spearman's rho on graphs with an arbitrary given degree distribution. We use this lower bound to show that for any fixed tail exponent, there exist scale-free degree sequences with this exponent such that the minimum value of Spearman's rho for all graphs with such degree sequences is arbitrary close to zero. This implies that specifying only the tail behavior of the degree distribution, as is often done in the analysis of complex networks, gives no guarantees for the minimum value of Spearman's rho.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。