Return a bipartite random graph.
This is a bipartite version of the binomial (Erdős-Rényi) graph.
Parameters : | n : int
m : int
p : float
seed : int, optional
directed : bool, optional (default=False)
|
---|
See also
gnp_random_graph, bipartite_configuration_model
Notes
The bipartite random graph algorithm chooses each of the n*m (undirected) or 2*nm (directed) possible edges with probability p.
This algorithm is O(n+m) where m is the expected number of edges.
The nodes are assigned the attribute ‘bipartite’ with the value 0 or 1 to indicate which bipartite set the node belongs to.
References
[R188] | Vladimir Batagelj and Ulrik Brandes, “Efficient generation of large random networks”, Phys. Rev. E, 71, 036113, 2005. |