2007/01/24 by Xinping Xu, Xu Xin-Ping, Feng Liu +1
Computer Science · Mathematics · Physics and Astronomy · #Advanced Clustering Algorithms Research #Complex Network Analysis Techniques #Limits and Structures in Graph Theory #math-ph #math.MP
paper · pdf · doi:10.1088/1009-1963/16/2/002
published as Chinese Physics 16(2007)282 · 7 pages, 3 figures
openalex publication_date 2007/01/24 · arxiv created 2007/08/20 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/30
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.