随机无标度网络的基本结构约束
Fundamental Structural Constraint of Random Scale-Free Networks
摘要:
我们研究了随机无标度网络的结构约束,它决定了度指数$γ$和热力学极限上界$k_c$的可能组合。我们采用的框架提出的图形转换[德尔Genio和同事,物理。{ \bf 107},178701(2011)],同时使其更严格并适用于kc的一般值。使用的图形性标准,我们表明,上限必须低于$k_c N^{1/γ}$为$γ< 2$,而任何上限截止允许为$γ> 2$。这一结果也通过度序列的随机抽样和确定性抽样得到了数值验证。
英文摘要:
We study the structural constraint of random scale-free networks that determines possible combinations of the degree exponent $γ$ and the upper cutoff $k_c$ in the thermodynamic limit. We employ the framework of graphicality transitions proposed by [Del Genio and co-workers, Phys. Rev. Lett. {\bf 107}, 178701 (2011)], while making it more rigorous and applicable to general values of kc. Using the graphicality criterion, we show that the upper cutoff must be lower than $k_c N^{1/γ}$ for $γ< 2$, whereas any upper cutoff is allowed for $γ> 2$. This result is also numerically verified by both the random and deterministic sampling of degree sequences.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。