7.3.9.6. networkx.algorithms.bipartite.generators.preferential_attachment_graph¶

networkx.algorithms.bipartite.generators.preferential_attachment_graph(aseq, p, create_using=None, seed=None)[source]¶

Create a bipartite graph with a preferential attachment model from a given single degree sequence.

Parameters:	aseq : list Degree sequence for node set A. p : float Probability that a new bottom node is added. create_using : NetworkX graph instance, optional Return graph of this type. seed : integer, optional Seed for random number generator.

Notes

This function is not imported in the main namespace. To use it you have to explicitly import the bipartite package.

References

[R497]

Jean-Loup Guillaume and Matthieu Latapy, Bipartite structure of all complex networks, Inf. Process. Lett. 90, 2004, pg. 215-221 http://dx.doi.org/10.1016/j.ipl.2004.03.007