{
  "id": "1301.5579",
  "version": "v1",
  "published": "2013-01-23T17:38:08.000Z",
  "updated": "2013-01-23T17:38:08.000Z",
  "title": "Random intersection graph process",
  "authors": [
    "Mindaugas Bloznelis",
    "Michal Karonski"
  ],
  "categories": [
    "math.PR",
    "math.CO",
    "math.ST",
    "stat.TH"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-01-23T17:38:08.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C80",
      "05C07",
      "05C82"
    ],
    "keywords": [
      "random intersection graph process",
      "modeling sparse evolving affiliation networks",
      "clustering coefficients",
      "asymptotic degree distribution",
      "explicit asymptotic formulas"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1301.5579B"
    }
  }
}