中国物理B ›› 2007, Vol. 16 ›› Issue (2): 282-286.doi: 10.1088/1009-1963/16/2/002
徐新平, 刘峰
Xu Xin-Ping(徐新平)† and Liu Feng(刘峰)
摘要: Recently, random graphs in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices have attracted much attention. This paper presents a specific realization of a class of random network models in which the connection probability between two vertices (i,j) is a specific function of degrees ki and kj. In the framework of the configuration model of random graphs, we find the analytical expressions for the degree correlation and clustering as a function of the variance of the desired degree distribution. The obtained expressions are checked by means of numerical simulations. Possible applications of our model are discussed.
中图分类号: (Combinatorics; graph theory)