arXiv · cond-mat/0504551
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-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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Imre Derenyi, Gergely Palla, Tamas Vicsek. 2005-04-21. Clique percolation in random networks. https://doi.org/10.1103/physrevlett.94.160202
Cite the original work for its findings. Save a collection to share your selection of sources.