Mindaugas Bloznelis, Michal Karonski
Published 2013-01-23Version 1
We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks that admit tunable (power law) degree distribution and assortativity and clustering coefficients. We show the asymptotic degree distribution and provide explicit asymptotic formulas for assortativity and clustering coefficients.
Degree distribution of an inhomogeneous random intersection graph
A note on the vertex degree distribution of random intersection graphs
Asymptotic degree distribution of a duplication-deletion random graph model
![QR code for arXiv:1301.5579 [math.PR]](http://oss.arxitics.com/images/favicon.svg)