Clique percolation in random networks

I. Derényi, Gergely Palla, T. Vicsek

Research output: Contribution to journalArticle

306 Citations (Scopus)

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-Rényi 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 nontrivial 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.

Original languageEnglish
Article number160202
JournalPhysical Review Letters
Volume94
Issue number16
DOIs
Publication statusPublished - Apr 29 2005

Fingerprint

apexes
transition points
scaling
thresholds

ASJC Scopus subject areas

  • Physics and Astronomy(all)
  • Medicine(all)

Cite this

Clique percolation in random networks. / Derényi, I.; Palla, Gergely; Vicsek, T.

In: Physical Review Letters, Vol. 94, No. 16, 160202, 29.04.2005.

Research output: Contribution to journalArticle

@article{dec63713560744fa8a4a66efc8a5b27b,
title = "Clique percolation in random networks",
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-R{\'e}nyi 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 nontrivial 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.",
author = "I. Der{\'e}nyi and Gergely Palla and T. Vicsek",
year = "2005",
month = "4",
day = "29",
doi = "10.1103/PhysRevLett.94.160202",
language = "English",
volume = "94",
journal = "Physical Review Letters",
issn = "0031-9007",
publisher = "American Physical Society",
number = "16",

}

TY - JOUR

T1 - Clique percolation in random networks

AU - Derényi, I.

AU - Palla, Gergely

AU - Vicsek, T.

PY - 2005/4/29

Y1 - 2005/4/29

N2 - 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-Rényi 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 nontrivial 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.

AB - 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-Rényi 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 nontrivial 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.

UR - http://www.scopus.com/inward/record.url?scp=18144393488&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=18144393488&partnerID=8YFLogxK

U2 - 10.1103/PhysRevLett.94.160202

DO - 10.1103/PhysRevLett.94.160202

M3 - Article

C2 - 15904198

AN - SCOPUS:18144393488

VL - 94

JO - Physical Review Letters

JF - Physical Review Letters

SN - 0031-9007

IS - 16

M1 - 160202

ER -