摘要
研究了一类同时具有择优和随机选择的混合性网络模型的度序列.利用Stolz定理给出了求解网络模型度序列的严格而简易的方法.发现模型的度序列服从幂律分布,度指数可以在3到之间变化.此外,还将模型推广到每步增加边数为随机变量的情况,得到类似的结论.
The degree sequence of a random graph with both random and preferential attachment is studied.Based on the Stolz theorem,a rigorous and simple method for studying degree sequence of network models is proposed.It is found that the degree distribution follows power-law with degree exponent changing from 3 to.Moreover,we generalize the model to add variable number of edges at each time step,also get similar results.
出处
《河北工业大学学报》
CAS
北大核心
2010年第5期17-19,40,共4页
Journal of Hebei University of Technology
关键词
随机图
度序列
幂律
random graph
degree sequence
power-law