Random intersection graph process
classification
🧮 math.PR
math.COmath.STstat.TH
keywords
assortativityasymptoticclusteringcoefficientsdegreedistributiongraphintersection
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.