Clique percolation in random graphs
arXiv:1508.01878 · doi:10.1103/PhysRevE.92.042116
Abstract
As a generation of the classical percolation, clique percolation focuses on the connection of cliques in a graph, where the connection of two -cliques means that they share at least vertices. In this paper, we develop a theoretical approach to study clique percolation in Erdős-Rényi graphs, which gives not only the exact solutions of the critical point, but also the corresponding order parameter. Based on this, we prove theoretically that the fraction of cliques in the giant clique cluster always makes a continuous phase transition as the classical percolation. However, the fraction of vertices in the giant clique cluster for makes a step-function-like discontinuous phase transition in the thermodynamic limit and a continuous phase transition for . More interesting, our analysis shows that at the critical point, the order parameter for is neither nor , but a constant depending on and . All these theoretical findings are in agreement with the simulation results, which give theoretical support and clarification for previous simulation studies of clique percolation.
6 pages, 5 figures
References in corpus (13)
- Uncovering the overlapping community structure of complex networks in nature and society
- Quantifying social group evolution
- Clique percolation in random networks
- Recent advances in percolation theory and its applications
- Weighted network modules
- Random graphs containing arbitrary distributions of subgraphs
- Recent advances and open challenges in percolation
- Directed network modules
- Bond percolation on a class of clustered random networks
- Spectral and network methods in the analysis of correlation matrices of stock returns
- The critical point of k-clique percolation in the Erdos-Renyi graph
- Cascades on clique-based graphs
- Triangle percolation in mean field random graphs -- with PDE