5.5k citations · 8.1k across the 11 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
cond-mat.dis-nn2006★ 38 cited
The critical point of k-clique percolation in the Erdos-Renyi graph
Gergely Palla, Imre Derenyi, Tamas Vicsek
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 i…
cond-mat.stat-mech2006★ 65 cited
Preferential attachment of communities: the same principle, but a higher level
Peter Pollner, Gergely Palla, Tamas Vicsek
The graph of communities is a network emerging above the level of individual nodes in the hierarchical organisation of a complex system. In this graph the nodes correspond to commu…