arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.07032physics.soc-phcs.SImath.PR
收藏

具有优先增删边的生长网络

Growing networks with preferential addition and deletion of edges

Maria Deijfen, Mathias Lindholm

摘要:

研究了一个含有删除边的生长网络的偏好连接模型,并分析了期望渐近度分布。在每个时间步$t=1,2,\ldots$,以概率$π_1>0$将具有一个附接到其上的边的新顶点添加到网络中,并且该边连接到与其度成比例地选择的现有顶点,以概率$π_2$选择与其度成比例的顶点,并且在该顶点与随机选择的其他顶点之间添加边,并且以概率$π_3=1-π_1-π_2<1/2$选择与其度成比例的顶点,并且删除该顶点的随机边。该模型的目的是捕捉的情况下,高度顶点比低度顶点的连接往往会发生变化的意义上说,更动态。一个递归公式导出的预期渐近分数$p_k$的度$k$的顶点,并解决这个递归揭示,对于$π_3<1/3$,我们有$p_k\sim k^{-(3-7π_3)/(1-3π_3)}$,而对于$π_3>1/3$,分数$p_k$指数衰减率$(π_1+π_2)/2π_3$。因此,在不失去度分布的幂律行为的情况下,网络可以包含多少删除,这是一个非平凡的上限。分析结果得到了仿真的支持。

英文摘要:

A preferential attachment model for a growing network incorporating deletion of edges is studied and the expected asymptotic degree distribution is analyzed. At each time step $t=1,2,\ldots$, with probability $π_1>0$ a new vertex with one edge attached to it is added to the network and the edge is connected to an existing vertex chosen proportionally to its degree, with probability $π_2$ a vertex is chosen proportionally to its degree and an edge is added between this vertex and a randomly chosen other vertex, and with probability $π_3=1-π_1-π_2<1/2$ a vertex is chosen proportionally to its degree and a random edge of this vertex is deleted. The model is intended to capture a situation where high-degree vertices are more dynamic than low-degree vertices in the sense that their connections tend to be changing. A recursion formula is derived for the expected asymptotic fraction $p_k$ of vertices with degree $k$, and solving this recursion reveals that, for $π_3<1/3$, we have $p_k\sim k^{-(3-7π_3)/(1-3π_3)}$, while, for $π_3>1/3$, the fraction $p_k$ decays exponentially at rate $(π_1+π_2)/2π_3$. There is hence a non-trivial upper bound for how much deletion the network can incorporate without loosing the power-law behavior of the degree distribution. The analytical results are supported by simulations.

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

↑