{
  "id": "cond-mat/0504551",
  "version": "v1",
  "published": "2005-04-21T10:35:38.000Z",
  "updated": "2005-04-21T10:35:38.000Z",
  "title": "Clique percolation in random networks",
  "authors": [
    "Imre Derenyi",
    "Gergely Palla",
    "Tamas Vicsek"
  ],
  "comment": "4 pages, 3 figures, to be published in Phys. Rev. Lett",
  "journal": "Phys. Rev. Lett. 94, 160202 (2005)",
  "doi": "10.1103/PhysRevLett.94.160202",
  "categories": [
    "cond-mat.dis-nn",
    "cond-mat.stat-mech",
    "physics.bio-ph"
  ],
  "abstract": "The notion of k-clique percolation in random graphs is introduced, where k is the size of the complete subgraphs whose large scale organizations are analytically and numerically investigated. For the Erdos-Renyi graph of N vertices we obtain that the percolation transition of k-cliques takes place when the probability of two vertices being connected by an edge reaches the threshold pc(k)=[(k-1)N]^{-1/(k-1)}. At the transition point the scaling of the giant component with N is highly non-trivial and depends on k. We discuss why clique percolation is a novel and efficient approach to the identification of overlapping communities in large real networks.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2005-04-21T10:35:38.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "random networks",
      "large real networks",
      "large scale organizations",
      "k-clique percolation",
      "random graphs"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "APS",
      "journal": "Phys. Rev. Lett."
    },
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}