arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.00779math.PR
收藏

无标度网络临界点的距离

Distances in scale free networks at criticality

Steffen Dereich, Christian Mönch, Peter Mörters

摘要:

当幂律指数超过临界值3时,具有适度边缘依赖性的无标度网络经历超小和小世界行为之间的相变。另外,巨连通分支中任意两个顶点的图距也存在大数定律。当度分布遵循纯幂律时,在临界值为3的情况下,$\frac{\log N}{\log\log N}$的渐近距离相同,但在超小区域,研究最多的秩1和偏好连接模型类之间的差异为2。在本文中,我们确定了这个因素出现的关键窗口。当度至少为~ $k$的顶点的渐近比例像$k^{-2} (\log k)^{2α+ o(1)}$一样缩放时,我们从这两个类别中查看模型,并表明对于偏好连接网络,当顶点的数量~ $N$趋于无穷大时,典型的距离在概率上是$\big(\frac{1}{1+α}+o(1)\big)\frac{\log N}{\log\log N}$。相比之下,具有相同渐近度序列的秩1模型中的典型距离是$\big(\frac{1}{1+2α}+o(1)\big)\frac{\log N}{\log\log N}.$。由于$α\to\infty$,我们看到,当我们接近超小区域时,最短路径的长度之间出现了因子2。

英文摘要:

Scale-free networks with moderate edge dependence experience a phase transition between ultrasmall and small world behaviour when the power law exponent passes the critical value of three. Moreover, there are laws of large numbers for the graph distance of two randomly chosen vertices in the giant component. When the degree distribution follows a pure power law these show the same asymptotic distances of $\frac{\log N}{\log\log N}$ at the critical value three, but in the ultrasmall regime reveal a difference of a factor two between the most-studied rank-one and preferential attachment model classes. In this paper we identify the critical window where this factor emerges. We look at models from both classes when the asymptotic proportion of vertices with degree at least~$k$ scales like $k^{-2} (\log k)^{2α+ o(1)}$ and show that for preferential attachment networks the typical distance is $\big(\frac{1}{1+α}+o(1)\big)\frac{\log N}{\log\log N}$ in probability as the number~$N$ of vertices goes to infinity. By contrast the typical distance in a rank one model with the same asymptotic degree sequence is $\big(\frac{1}{1+2α}+o(1)\big)\frac{\log N}{\log\log N}.$ As $α\to\infty$ we see the emergence of a factor two between the length of shortest paths as we approach the ultrasmall regime.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑