{
  "id": "0809.1141",
  "version": "v1",
  "published": "2008-09-06T07:09:10.000Z",
  "updated": "2008-09-06T07:09:10.000Z",
  "title": "Vertex Degree of Random Intersection Graph",
  "authors": [
    "Bhupendra Gupta"
  ],
  "categories": [
    "math.PR"
  ],
  "abstract": "A random intersection graph is constructed by independently assigning a subset of a given set of objects $W,$ to each vertex of the vertex set $V$ of a simple graph $G.$ There is an edge between two vertices of $V,$ iff their respective subsets(in $W$,) have at least one common element. The strong threshold for the connectivity between any two arbitrary vertices of vertex set $V,$ is derived. Also we determine the almost sure probability bounds for the vertex degree of a typical vertex of graph $G.$",
  "revisions": [
    {
      "version": "v1",
      "updated": "2008-09-06T07:09:10.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "random intersection graph",
      "vertex degree",
      "vertex set",
      "sure probability bounds",
      "simple graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008arXiv0809.1141G"
    }
  }
}