How likely is an i.i.d. degree sequence to be graphical?

Citation
Arratia, Richard et M. Liggett, Thomas, How likely is an i.i.d. degree sequence to be graphical?, Annals of applied probability , 15((1B)), 2005, pp. 652-670
ISSN journal
10505164
Volume
15
Issue
(1B)
Year of publication
2005
Pages
652 - 670
Database
ACNP
SICI code
Abstract
Given i.i.d. positive integer valued random variables D1,.,Dn, one can ask whether there is a simple graph on n vertices so that the degrees of the vertices are D1,.,Dn. We give sufficient conditions on the distribution of Di for the probability that this be the case to be asymptotically 0, ½ or strictly between 0 and ½. These conditions roughly correspond to whether the limit of nP(Di.n) is infinite, zero or strictly positive and finite. This paper is motivated by the problem of modeling large communications networks by random graphs.