title: Fast Sequential Creation of Random Realizations of Degree Sequences.
abstract: We examine the problem of creating random realizations of very large degree sequences. Although fast in practice, the Markov chain Monte Carlo (MCMC) method for selecting a realization has limited usefulness for creating large graphs because of memory constraints. Instead, we focus on sequential importance sampling (SIS) schemes for random graph creation. A difficulty with SIS schemes is assuring that they terminate in a reasonable amount of time. We introduce a new sampling method by which we guarantee termination while achieving speed comparable to the MCMC method.
authors: National Institute of Standards and Technology, Applied and Computational Mathematics Division, Gaithersburg, MD.
authors: Brian
authors: B
authors: Cloteaux