Fast sequential algorithm for generating directed random graphs with a given degree sequence

Abstract

We propose a near-linear complexity algorithm for generating simple directed random graphs with a given degree sequence and show that this algorithm provides a means of uniform sampling for large graphs. The algorithm is applicable when the maximum degree, dmax, is asymptotically dominated by m1/4 with m being the number of edges and admits an implementation with the expected running time of the order of mdmax.