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

随机几何偏好连接图的相变

Phase transitions for random geometric preferential attachment graphs

Jonathan Jordan, Andrew R. Wade

摘要:

我们研究了一个不断发展的空间网络中,顺序到达的顶点加入现有的顶点随机根据一个规则,结合根据度的偏好与偏好,根据空间接近度。我们调查图结构中的相变作为这两个组件的附件规则的相对权重是不同的。作者之一的先前工作表明,当几何分量是弱的,所得到的图的极限度序列与标准的Barabási-Albert偏好连接模型相一致。我们表明,在另一个极端,在一个足够强大的几何组件的情况下,限制度序列与一个纯粹的几何模型,在线最近邻图,这是感兴趣的在自己的权利,我们证明了一些已知结果的扩展相吻合。我们还表明存在一个中间政权,其中的行为显着不同的在线最近邻图和Barabási-阿尔伯特模型,在这个政权中,我们得到一个拉伸指数上界的程度序列。我们的结果为Manna和Sen的模拟研究提供了一些数学支持,同时证明拉伸指数相变的幂律发生在与这些作者推测的不同的点。

英文摘要:

We study an evolving spatial network in which sequentially arriving vertices are joined to existing vertices at random according to a rule that combines preference according to degree with preference according to spatial proximity. We investigate phase transitions in graph structure as the relative weighting of these two components of the attachment rule is varied. Previous work of one of the authors showed that when the geometric component is weak, the limiting degree sequence of the resulting graph coincides with that of the standard Barabási--Albert preferential attachment model. We show that at the other extreme, in the case of a sufficiently strong geometric component, the limiting degree sequence coincides with that of a purely geometric model, the on-line nearest-neighbour graph, which is of interest in its own right and for which we prove some extensions of known results. We also show the presence of an intermediate regime, in which the behaviour differs significantly from both the on-line nearest-neighbour graph and the Barabási--Albert model; in this regime, we obtain a stretched exponential upper bound on the degree sequence. Our results lend some mathematical support to simulation studies of Manna and Sen, while proving that the power law to stretched exponential phase transition occurs at a different point from the one conjectured by those authors.

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

↑