Clique percolation in random networks

Simple item page
dc.creatorDerenyi, Imre
dc.creatorPalla, Gergely
dc.creatorVicsek, Tamas
dc.date2005-04-21
dc.date.accessioned2026-07-07T03:04:51Z
dc.date.available2026-07-07T03:04:51Z
dc.descriptionThe 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.
dc.description4 pages, 3 figures, to be published in Phys. Rev. Lett
dc.identifierhttps://arxiv.org/abs/cond-mat/0504551
dc.identifierhttp://arxiv.org/abs/cond-mat/0504551
dc.identifierPhys. Rev. Lett. 94, 160202 (2005)
dc.identifierdoi:10.1103/PhysRevLett.94.160202
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/26243
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.subjectBiological Physics
dc.titleClique percolation in random networks
dc.typetext

Files

Collections

arXiv