Random intersection graph process
Probability
2013-01-24 v1 Combinatorics
Statistics Theory
Statistics Theory
Abstract
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.
Cite
@article{arxiv.1301.5579,
title = {Random intersection graph process},
author = {Mindaugas Bloznelis and Michal Karonski},
journal= {arXiv preprint arXiv:1301.5579},
year = {2013}
}