Expertini Research Research
Mathematics PDF Available Non-peer-reviewed Preprint

Random intersection graph process

Mindaugas Bloznelis, Michal Karonski  ·  Published 2013-01-23

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.

Keywords

📄 Full Paper Available as PDF
This paper is available as a downloadable PDF.
📄 Download PDF

✨ AI Plain-English Summary

Get a plain-English summary of this paper generated by AI (5 free per day).

Comments (0)

No comments yet. Be the first to comment.