Clique percolation in random networks

Imre Derenyi, Gergely Palla, Tamas Vicsek

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 in…