networkx.generators.bipartite.bipartite_preferential_attachment_graph

networkx.generators.bipartite.bipartite_preferential_attachment_graph(aseq, p, create_using=None, seed=None)

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

Parameters :

aseq : list or iterator

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

@article{guillaume-2004-bipartite,

author = {Jean-Loup Guillaume and Matthieu Latapy}, title = {Bipartite structure of all complex networks}, journal = {Inf. Process. Lett.}, volume = {90}, number = {5}, year = {2004}, issn = {0020-0190}, pages = {215–221}, doi = {http://dx.doi.org/10.1016/j.ipl.2004.03.007}, publisher = {Elsevier North-Holland, Inc.}, address = {Amsterdam, The Netherlands, The Netherlands}, }