Generating Random Regular Graphs Quickly

Abstract

We present a practical algorithm for generating random regular graphs. For all d growing as a small power of n , the d -regular graphs on n vertices are generated approximately uniformly at random, in the sense that all d -regular graphs on n vertices have in the limit the same probability as n → ∞. The expected runtime for these d s is [Oscr ]( nd 2 ).