The critical point of k-clique percolation in the Erdos-Renyi graph

Details The critical point of k-clique percolation in the Erdos-Renyi graph The critical point of k-clique percolation in the Erdos-Renyi graph

2006-10-11

arxiv.org/abs/cond-mat/0610298v1

Physics

Condensed Matter

Disordered Systems and Neural Networks

12 pages, 2 figures

Scientific paper

10.1007/s10955-006-9184-x

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).

Affiliated with

Also associated with

No associations

Rating

The critical point of k-clique percolation in the Erdos-Renyi graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The critical point of k-clique percolation in the Erdos-Renyi graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The critical point of k-clique percolation in the Erdos-Renyi graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578652