中国物理B ›› 2007, Vol. 16 ›› Issue (2): 282-286.doi: 10.1088/1009-1963/16/2/002

• • 上一篇    下一篇

A novel configuration model for random graphs with given degree sequence

徐新平, 刘峰   

  1. Institute of Particle Physics, Huazhong Normal University, Wuhan 430079, China
  • 收稿日期:2006-03-16 修回日期:2006-04-04 出版日期:2007-02-20 发布日期:2007-02-20
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant Nos 10375025 and 10275027) and the Cultivation Fund of the Key Scientific and Technical Innovation Project, Ministry of Education of China (Grant No~704035).

A novel configuration model for random graphs with given degree sequence

Xu Xin-Ping(徐新平) and Liu Feng(刘峰)   

  1. Institute of Particle Physics, Huazhong Normal University, Wuhan 430079, China
  • Received:2006-03-16 Revised:2006-04-04 Online:2007-02-20 Published:2007-02-20
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant Nos 10375025 and 10275027) and the Cultivation Fund of the Key Scientific and Technical Innovation Project, Ministry of Education of China (Grant No~704035).

摘要: 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.

关键词: random graphs, configuration model, correlations

Abstract: 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.

Key words: random graphs, configuration model, correlations

中图分类号:  (Combinatorics; graph theory)

  • 02.10.Ox
02.50.Cw (Probability theory) 05.40.-a (Fluctuation phenomena, random processes, noise, and Brownian motion)