一类增长网络模型的度分布
On the degree distribution of a growing network model
摘要：
本文对一类随机增长网络模型中给定顶点的度的分布作了一些具体的观察。网络增长的规律如下。从一个最小度至少为$k$的初始图开始，逐个添加新的顶点。每个新顶点$v$首先选择一个随机顶点$w$进行连接，其中选择$w$的概率与其度成正比。然后，将$k$边从$v$添加到随机选择的$w$的邻居。
英文摘要：
In this note we make some specific observations on the distribution of the degree of a given vertex in certain model of randomly growing networks. The rule for network growth is the following. Starting with an initial graph of minimum degree at least $k$, new vertices are added one by one. Each new vertex $v$ first chooses a random vertex $w$ to join to, where the probability of choosing $w$ is proportional to its degree. Then $k$ edges are added from $v$ to randomly chosen neighbours of $w$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
