represents a Bernoulli graph distribution for n-vertex graphs with edge probability p.
- The Bernoulli graph is constructed starting with the complete graph with n vertices and selecting each edge independently through a Bernoulli trial with probability p.
- The following options can be given:
DirectedEdges False whether to generate directed edges SelfLoops False whether to generate self-loops
- BernoulliGraphDistribution can be used with such functions as RandomGraph and GraphPropertyDistribution.
New in 8