无标度零模型中的度相关性
Degree correlations in scale-free null models
摘要:
研究了度为$k$的顶点的平均最近邻度$a(k)$。在许多具有幂律度分布的真实网络中,$a(k)$在$k$中会下降,这是一种归因于任何两个顶点最多由一条边连接的约束的属性。我们证明了$a(k)$在三个幂律度的简单随机图零模型中确实衰变在$k$中:擦除配置模型、秩1非齐次随机图和双曲随机图.我们考虑当节点数量$n$趋于无穷大时的大型网络限制。我们发现,对于所有三个零模型,$a(k)$开始衰减超过$n^{(τ-2)/(τ-1)}$,然后解决了幂律$a(k)\sim k^{τ-3}$,与$τ$的度指数。
英文摘要:
We study the average nearest neighbor degree $a(k)$ of vertices with degree $k$. In many real-world networks with power-law degree distribution $a(k)$ falls off in $k$, a property ascribed to the constraint that any two vertices are connected by at most one edge. We show that $a(k)$ indeed decays in $k$ in three simple random graph null models with power-law degrees: the erased configuration model, the rank-1 inhomogeneous random graph and the hyperbolic random graph. We consider the large-network limit when the number of nodes $n$ tends to infinity. We find for all three null models that $a(k)$ starts to decay beyond $n^{(τ-2)/(τ-1)}$ and then settles on a power law $a(k)\sim k^{τ-3}$, with $τ$ the degree exponent.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。