Sách Degree distributions in general random intersection graphs

Abstract
We study G(n, m, F, H), a variant of the standard random intersection graph
model in which random weights are assigned to both vertex types in the bipartite
structure. Under certain assumptions on the distributions of these weights, the
degree of a vertex is shown to depend on the weight of that particular vertex and
on the distribution of the weights of the other vertex type.