A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees

Random graphs with a given degree sequence are a useful model capturing several features absent in the classical Erdős-Rényi model, such as dependent edges and non-binomial degrees. In this paper, we use a characterization due to Erdős and Gallai to develop a sequential algorithm for generating a random labeled graph with a given degree sequence. The… CONTINUE READING

7 Figures & Tables



Citations per Year

169 Citations

Semantic Scholar estimates that this publication has 169 citations based on the available data.

See our FAQ for additional information.