Open Access
2013 Assortativity and clustering of sparse random intersection graphs
Mindaugas Bloznelis, Jerzy Jaworski, Valentas Kurauskas
Author Affiliations +
Electron. J. Probab. 18: 1-24 (2013). DOI: 10.1214/EJP.v18-2277


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.


Download Citation

Mindaugas Bloznelis. Jerzy Jaworski. Valentas Kurauskas. "Assortativity and clustering of sparse random intersection graphs." Electron. J. Probab. 18 1 - 24, 2013.


Accepted: 13 March 2013; Published: 2013
First available in Project Euclid: 4 June 2016

zbMATH: 1278.05223
MathSciNet: MR3035766
Digital Object Identifier: 10.1214/EJP.v18-2277

Primary: 05C80
Secondary: 05C82 , 91D30

Keywords: assortativity , clustering , power law , random graph , random intersection graph

Vol.18 • 2013
Back to Top