A novel configuration model for random graphs with given degree sequence

Recently, random graphs in which vertices are characterized byhidden variables controlling the establishment of edgesbetween pairs of vertices have attracted much attention. This paper presents a specific realization of a class of randomnetwork models in which the connection probabilitybetween 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 correlationand clustering as a function of the variance of the desired degreedistribution. The obtained expressions are checked by meansof numerical simulations. Possible applications of our model are discussed.