Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph (Q6151860)

Summary: In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. As a result, many interesting functions of the joint distribution of graph degrees, such as the distribution of the median degree, become amenable to estimation. Our result is established by proving an asymptotic formula conjectured in [\textit{B. D. McKay} and \textit{N. C. Wormald}, Eur. J. Comb. 11, No. 6, 565--580 (1990; Zbl 0739.05043)] for the number of graphs with given degree sequence. In particular, this gives an asymptotic formula for the number of \(d\)-regular graphs for all \(d\), as \(n \to \infty\). The key to our results is a new approach to estimating ratios between point probabilities in the space of degree sequences of the random graph, including analysis of fixed points of the associated operators.