The critical point of k-clique percolation in the Erdos-Rényi graph

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

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

Motivated by the success of a k-clique percolation method for the identification of overlapping communities in large real networks, here we study the k-clique percolation problem in the Erdos-Rényi graph. When the probability p of two nodes being connected is above a certain threshold p c (k), the complete subgraphs of size k (the k-cliques) are organized into a giant cluster. By making some assumptions that are expected to be valid below the threshold, we determine the average size of the k-clique percolation clusters, using a generating function formalism. From the divergence of this average size we then derive an analytic expression for the critical linking probability p c (k).

Original languageEnglish
Pages (from-to)219-227
Number of pages9
JournalJournal of Statistical Physics
Volume128
Issue number1-2
DOIs
Publication statusPublished - Jul 2007

Fingerprint

Erdös
Clique
Critical point
critical point
Graph in graph theory
thresholds
divergence
formalism
Linking
Generating Function
Overlapping
Subgraph
Divergence
Valid
Vertex of a graph

Keywords

  • Community
  • Network
  • Percolation
  • Random graph

ASJC Scopus subject areas

  • Physics and Astronomy(all)
  • Statistical and Nonlinear Physics
  • Mathematical Physics

Cite this

The critical point of k-clique percolation in the Erdos-Rényi graph. / Palla, Gergely; Derényi, I.; Vicsek, T.

In: Journal of Statistical Physics, Vol. 128, No. 1-2, 07.2007, p. 219-227.

Research output: Contribution to journalArticle

@article{26f3b0a186f14f6d83d4eaef53913fd4,
title = "The critical point of k-clique percolation in the Erdos-R{\'e}nyi graph",
abstract = "Motivated by the success of a k-clique percolation method for the identification of overlapping communities in large real networks, here we study the k-clique percolation problem in the Erdos-R{\'e}nyi graph. When the probability p of two nodes being connected is above a certain threshold p c (k), the complete subgraphs of size k (the k-cliques) are organized into a giant cluster. By making some assumptions that are expected to be valid below the threshold, we determine the average size of the k-clique percolation clusters, using a generating function formalism. From the divergence of this average size we then derive an analytic expression for the critical linking probability p c (k).",
keywords = "Community, Network, Percolation, Random graph",
author = "Gergely Palla and I. Der{\'e}nyi and T. Vicsek",
year = "2007",
month = "7",
doi = "10.1007/s10955-006-9184-x",
language = "English",
volume = "128",
pages = "219--227",
journal = "Journal of Statistical Physics",
issn = "0022-4715",
publisher = "Springer New York",
number = "1-2",

}

TY - JOUR

T1 - The critical point of k-clique percolation in the Erdos-Rényi graph

AU - Palla, Gergely

AU - Derényi, I.

AU - Vicsek, T.

PY - 2007/7

Y1 - 2007/7

N2 - Motivated by the success of a k-clique percolation method for the identification of overlapping communities in large real networks, here we study the k-clique percolation problem in the Erdos-Rényi graph. When the probability p of two nodes being connected is above a certain threshold p c (k), the complete subgraphs of size k (the k-cliques) are organized into a giant cluster. By making some assumptions that are expected to be valid below the threshold, we determine the average size of the k-clique percolation clusters, using a generating function formalism. From the divergence of this average size we then derive an analytic expression for the critical linking probability p c (k).

AB - Motivated by the success of a k-clique percolation method for the identification of overlapping communities in large real networks, here we study the k-clique percolation problem in the Erdos-Rényi graph. When the probability p of two nodes being connected is above a certain threshold p c (k), the complete subgraphs of size k (the k-cliques) are organized into a giant cluster. By making some assumptions that are expected to be valid below the threshold, we determine the average size of the k-clique percolation clusters, using a generating function formalism. From the divergence of this average size we then derive an analytic expression for the critical linking probability p c (k).

KW - Community

KW - Network

KW - Percolation

KW - Random graph

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

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

U2 - 10.1007/s10955-006-9184-x

DO - 10.1007/s10955-006-9184-x

M3 - Article

AN - SCOPUS:34249875971

VL - 128

SP - 219

EP - 227

JO - Journal of Statistical Physics

JF - Journal of Statistical Physics

SN - 0022-4715

IS - 1-2

ER -