Warning
This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
erdos_renyi_graph¶

erdos_renyi_graph
(n, p, seed=None, directed=False)¶ Returns a random graph, also known as an ErdősRényi graph or a binomial graph.
The model chooses each of the possible edges with probability
p
.The functions
binomial_graph()
anderdos_renyi_graph()
are aliases of this function.Parameters: See also
Notes
This algorithm runs in time. For sparse graphs (that is, for small values of ),
fast_gnp_random_graph()
is a faster algorithm.References
[1]  Erdős and A. Rényi, On Random Graphs, Publ. Math. 6, 290 (1959).
[2]  Gilbert, Random Graphs, Ann. Math. Stat., 30, 1141 (1959).