|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'501'711
Articles rated: 2609
19 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Clique percolation in random networks | | Imre Derenyi
; Gergely Palla
; Tamas Vicsek
; | | Date: |
21 Apr 2005 | | Journal: | Phys. Rev. Lett. 94, 160202 (2005) DOI: 10.1103/PhysRevLett.94.160202 | | Subject: | Disordered Systems and Neural Networks; Statistical Mechanics; Biological Physics | 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. | | Source: | arXiv, cond-mat/0504551 | | Other source: | [GID 137393] pmid15904198 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER