AbstractRecently, 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.
Received: 16 March 2006
Revised: 04 April 2006
Accepted manuscript online:
(Fluctuation phenomena, random processes, noise, and Brownian motion)
Fund: 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).
Cite this article:
Xu Xin-Ping(徐新平) and Liu Feng(刘峰) A novel configuration model for random graphs with given degree sequence 2007 Chinese Physics 16 282
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
