
arXiv: 0910.0616
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.
Graph representations (geometric and intersection representations, etc.), Probability (math.PR), Random graphs (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), random intersection graph, Mathematics - Probability
Graph representations (geometric and intersection representations, etc.), Probability (math.PR), Random graphs (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), random intersection graph, Mathematics - Probability
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 19 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
