The graph has ‘n’ vertices and ‘m’ edges,
and the ‘m’ edges are chosen uniformly randomly from the set of all
possible edges. This set includes loop edges as well if the loops
parameter is TRUE.
References
Erdos, P. and Renyi, A., On random graphs, Publicationes
Mathematicae 6, 290--297 (1959).