The critical point of k-clique percolation in the Erdos-Renyi graph
| dc.creator | Palla, Gergely | |
| dc.creator | Derenyi, Imre | |
| dc.creator | Vicsek, Tamas | |
| dc.date | 2006-10-11 | |
| dc.date.accessioned | 2026-07-07T07:27:27Z | |
| dc.date.available | 2026-07-07T07:27:27Z | |
| dc.description | 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-Renyi 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). | |
| dc.description | 12 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0610298 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0610298 | |
| dc.identifier | doi:10.1007/s10955-006-9184-x | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/117383 | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Statistical Mechanics | |
| dc.title | The critical point of k-clique percolation in the Erdos-Renyi graph | |
| dc.type | text |