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

优先连接图中最老边的删除

Deletion of oldest edges in a preferential attachment graph

Tony Johansson

摘要:

本文考虑了具有固定参数$m\in \mathbb{N}$和$1/2 < p < 1$的Barabási-Albert随机图过程的一个变形.以概率$p$,顶点与$m$边一起添加,随机选择与顶点度数成比例。在概率为$1 - p$的情况下,仍保持其原始$m$边的最旧顶点将丢失这些边。证明了任意顶点的度要么为零,要么服从几何分布。如果$p$高于某个阈值,则会导致度序列的幂律,而较小的$p$会给出指数尾。证明了图中存在唯一的巨分支whp当且仅当$m\geq 2$ .

英文摘要:

We consider a variation on the Barabási-Albert random graph process with fixed parameters $m\in \mathbb{N}$ and $1/2 < p < 1$. With probability $p$ a vertex is added along with $m$ edges, randomly chosen proportional to vertex degrees. With probability $1 - p$, the oldest vertex still holding its original $m$ edges loses those edges. It is shown that the degree of any vertex either is zero or follows a geometric distribution. If $p$ is above a certain threshold, this leads to a power law for the degree sequence, while a smaller $p$ gives exponential tails. It is also shown that the graph contains a unique giant component whp if and only if $m\geq 2$.

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

↑