Random Graphs 3: The Random Regular Graph

This class defines our next random graph model, the random regular graph G(n,r). In this model, every node has the same degree (r), and we sample uniformly from the set of all r-regular graphs of size n. We introduce the configuration model as an elegant way to deal with the dependencies introduced by the regularity constraint, and use it to explore several fascinating and useful properties of this graph.