The Barabasi-Albert model describes a mechanism of generating random scale-free networks:Growth: Starting with a small number ($m_0$) of connected nodes, at every time step, we add a new node with $m$ ($<m0$) edges that link the new node to $m$ different nodes already present in the network. Preferential attachment: When choosing the nodes to which the new node connects, we assume that the probability $P$ that a new node will be connected to node $i$ depends on the degree $k_i$ of node $i$, such that $$P\propto \frac{k_i}{\sum_i k_i}$$Is there a similar model for scale-free bipartite networks? That is, is there a mechanism for generating random bipartite graphs that possess the usual properties of scale-free networks?
Bipartite scale-free networks
graph theory;network modeling