Super-star networks:通过似然性生长最佳无标度网络
Super-star networks: Growing optimal scale-free networks via likelihood
摘要:
优先连接(Preferential attachment)--新节点以与现有节点的度成比例的概率连接到现有节点--已经成为无标度网络的标准增长模型,其中节点具有度$k$的渐近概率与$k^{-γ}$成比例。然而,这种模式的动机完全是临时的。我们使用精确的似然参数,并表明建立无标度网络的最佳方法是将大多数新链接连接到低度节点。奇怪的是,这导致了一个具有单一主导枢纽的无标度网络:我们称之为超级星网络的星形结构。渐近地,最优策略是将每个新节点以与$\frac{1}{N+ζ(γ)(k+1)^γ}$(在$N$节点网络中)成比例的概率连接到度为$k$的节点之一--比标准优先连接所表现出的更强的对高度节点的偏好。我们的算法生成最优的无标度网络(超级明星网络),以及随机采样的空间中的所有无标度网络与给定的度指数$γ$。我们生成可行的实现有限$N$为$1\ll γ<2$以及$γ>2$。我们在$γ\approx 2$观察到一个明显的不连续过渡,介于所谓的超级星形网络和更树状的实现之间。逐渐增加的$γ$进一步导致超级明星枢纽的重新出现。为了量化这些结构特征,我们推导出一个新的解析表达式的期望度指数的纯优先连接过程,并引入替代措施的网络熵。我们的方法是通用的,也可以适用于任意的度分布。
英文摘要:
Preferential attachment --- by which new nodes attach to existing nodes with probability proportional to the existing nodes' degree --- has become the standard growth model for scale-free networks, where the asymptotic probability of a node having degree $k$ is proportional to $k^{-γ}$. However, the motivation for this model is entirely ad hoc. We use exact likelihood arguments and show that the optimal way to build a scale-free network is to attach most new links to nodes of low degree. Curiously, this leads to a scale-free networks with a single dominant hub: a star-like structure we call a super-star network. Asymptotically, the optimal strategy is to attach each new node to one of the nodes of degree $k$ with probability proportional to $\frac{1}{N+ζ(γ)(k+1)^γ}$ (in a $N$ node network) --- a stronger bias toward high degree nodes than exhibited by standard preferential attachment. Our algorithm generates optimally scale-free networks (the super-star networks) as well as randomly sampling the space of all scale-free networks with a given degree exponent $γ$. We generate viable realisation with finite $N$ for $1\ll γ<2$ as well as $γ>2$. We observe an apparently discontinuous transition at $γ\approx 2$ between so-called super-star networks and more tree-like realisations. Gradually increasing $γ$ further leads to re-emergence of a super-star hub. To quantify these structural features we derive a new analytic expression for the expected degree exponent of a pure preferential attachment process, and introduce alternative measures of network entropy. Our approach is generic and may also be applied to an arbitrary degree distribution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。