Assortativity and clustering of sparse random intersection graphs
Probability
2019-08-24 v1 Combinatorics
Statistics Theory
Statistics Theory
Abstract
We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of adjacent nodes (called the assortativity coefficient), the expected number of common neighbours of adjacent nodes, and the expected degree of a neighbour of a node of a given degree k. These expressions are written in terms of the asymptotic degree distribution and, alternatively, in terms of the parameters defining the underlying random graph model.
Cite
@article{arxiv.1209.4675,
title = {Assortativity and clustering of sparse random intersection graphs},
author = {Mindaugas Bloznelis and Jerzy Jaworski and Valentas Kurauskas},
journal= {arXiv preprint arXiv:1209.4675},
year = {2019}
}