Degree distributions in general random intersection graphs
The electronic journal of combinatorics, Tome 17 (2010)
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.
@article{10_37236_295,
author = {Yilun Shang},
title = {Degree distributions in general random intersection graphs},
journal = {The electronic journal of combinatorics},
year = {2010},
volume = {17},
doi = {10.37236/295},
zbl = {1184.05116},
url = {http://geodesic.mathdoc.fr/articles/10.37236/295/}
}
Yilun Shang. Degree distributions in general random intersection graphs. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/295
Cité par Sources :