一个具有任意实际或理论度分布的随机增长模型
A Random Growth Model with any Real or Theoretical Degree Distribution
摘要:
复杂网络的度分布通常被认为是幂律的。然而,其中许多国家的情况并非如此。因此,我们提出了一个新的模型,能够建立随机增长的网络(几乎)任何想要的度分布。度分布可以是理论上的,也可以是从现实世界的网络中提取的。其主要思想是将常用于计算度分布的递归方程进行反演,以找到一个方便的节点连接的连接函数-通常选择线性。我们计算了一些经典的分布,如幂律分布,破幂律分布,几何分布和泊松分布。我们还使用该模型的无向版本的Twitter网络,其中的度分布有一个不寻常的形状。我们最后表明,所选择的附着功能的分歧是沉重的链接到所获得的度分布的重尾属性。
英文摘要:
The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree distribution. The degree distribution can either be theoretical or extracted from a real-world network. The main idea is to invert the recurrence equation commonly used to compute the degree distribution in order to find a convenient attachment function for node connections - commonly chosen as linear. We compute this attachment function for some classical distributions, as the power-law, broken power-law, geometric and Poisson distributions. We also use the model on an undirected version of the Twitter network, for which the degree distribution has an unusual shape. We finally show that the divergence of chosen attachment functions is heavily links to the heavy-tailed property of the obtained degree distributions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。