Blitzstein, JosephDiaconis, Persi2009-03-272009-03-27Blitzstein, Joseph K., and Persi Diaconis. 2006. A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Unpublished paper.http://nrs.harvard.edu/urn-3:HUL.InstRepos:2757225Random graphs with a given degree sequence are a useful model capturing several features absent in the classical Erd˝os-R´enyi model, such as dependent edges and non-binomial degrees. In this paper, we use a characterization due to Erd˝os and Gallai to develop a sequential algorithm for generating a random labeled graph with a given degree sequence. The algorithm is easy to implement and allows surprisingly efficient sequential importance sampling. Applications are given, including simulating a biological network and estimating the number of graphs with a given degree sequence.en-USrandom graphssequential importance samplingexponential modelsrandom networksrandomized generating algorithmsgraphical degree sequences10.1080/15427951.2010.557277