- Draw from an Erdős-Rényi graph ensemble with a target connectivity.
- In this model, all possible edges are equally likely
- The number of edges is variable
P. Erdős and A. Rényi, “On the evolution of random graphs,” Publ. Math. Inst. Hungar. Acad. Sci. 5, 17-61 (1960)
Implements Erdős-Rényi graph ensemble
Returned by markov steps