In Maples package RandomGraphs, there is a method called RandomRegularGraph(n,d) which takes a number of vertices $n$ and a degree $d$ and returns a random $d$-regular graph on $n$ vertices. Does anybody know how this random regular graph is sampled, and if it is in fact uniformly chosen from all $d$-regular graphs on $n$ vertices?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top