摘要
无标度图在现实复杂网络中有着广泛的应用,特别在用以模拟万维网的发展趋势时,作为无标度图的结构参数,对其顶点度数序列的考察有着重要的意义.主要考察一类重要的无标度图,即Buckley-Osthus模型,首先研究其入度为d的顶点比例的一些渐近性质,然后,在图的大小趋于无穷时,得到顶点最大度数的收敛定理.
Scale-free graphs have many applications in complex networks, such as the ＂WWW＂ that has led to the emerging role of random networks. The degree sequences of Buckley-Osthus model were studied. Firstly, the asymptotic property for the vertices with indegree d was obtained, then the convergence of the maximal degree of vertices as the size of graph grows to infinity was investigated.
基金
国家自然科学基金(11101394
10671188)
高等学校博士学科点专项科研基金(20113402120005)
中国博士后科学基金资助
